import sys
n=int(input());a=list(map(int,input().split()));p=0;o=0
for i in range(1,91):
p+=1;l=i in a
if l==True:
p=0;o=i
if p==15:
print(p+o)
sys.exit()
print(90)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define SPEED ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
int main()
{
SPEED;
int n , ans = 0;
cin>>n;
int arr[n];
for (int i = 0; i < n; ++i)
cin>>arr[i];
int target = 15;
for (int i = 0; i < n; ++i)
{
if(arr[i] <= target)
target = arr[i] + 15;
}
if(target >= 90)
cout<<90<<endl;
else
cout<<target<<endl;
}714B - Filya and Homework | 31A - Worms Evolution |
1691A - Beat The Odds | 433B - Kuriyama Mirai's Stones |
892A - Greed | 32A - Reconnaissance |
1236D - Alice and the Doll | 1207B - Square Filling |
1676D - X-Sum | 1679A - AvtoBus |
1549A - Gregor and Cryptography | 918C - The Monster |
4B - Before an Exam | 545B - Equidistant String |
1244C - The Football Season | 1696B - NIT Destroys the Universe |
1674A - Number Transformation | 1244E - Minimizing Difference |
1688A - Cirno's Perfect Bitmasks Classroom | 219A - k-String |
952A - Quirky Quantifiers | 451B - Sort the Array |
1505H - L BREAK into program | 171E - MYSTERIOUS LANGUAGE |
630D - Hexagons | 1690D - Black and White Stripe |
1688D - The Enchanted Forest | 1674C - Infinite Replacement |
712A - Memory and Crow | 1676C - Most Similar Words |