CodeForces 673A Bear and Game

Description

Bear Limak likes watching sports on TV. He is going to watch a game today. The game lasts 90 minutes and there are no breaks.

Each minute can be either interesting or boring. If 15 consecutive minutes are boring then Limak immediately turns TV off.

You know that there will be n interesting minutes t₁, t₂, ..., t_n. Your task is to calculate for how many minutes Limak will watch the game.

Input

The first line of the input contains one integer n (1 ≤ n ≤ 90) — the number of interesting minutes.

The second line contains n integers t₁, t₂, ..., t_n (1 ≤ t₁ < t₂ < ... t_n ≤ 90), given in the increasing order.

Output

Print the number of minutes Limak will watch the game.

Sample Input

Input

37 20 88

Output

35

Input

916 20 30 40 50 60 70 80 90

Output

15

Input

915 20 30 40 50 60 70 80 90

Output

90

#include<stdio.h>#include<math.h>int main(){int n;int a[110];   while(scanf("%d",&n)!=EOF)   {   int i;   for(i=0;i<n;i++)   {   scanf("%d",&a[i]);   }   if(a[0]>15)   {   printf("15\n");   continue;} int sum=a[0];for(i=1;i<n;i++){if(a[i]-a[i-1]>15){break;}else{sum=a[i];}}sum+=15;if(sum<=90)printf("%d\n",sum);elseprintf("90\n");    }}