CodeForces 673A Bear and Game

最新推荐文章于 2019-11-24 16:27:03 发布

Never_Say-Never

最新推荐文章于 2019-11-24 16:27:03 发布

阅读量226

点赞数

分类专栏：水题

本文链接：https://blog.csdn.net/z1192277815/article/details/51512311

版权

水题专栏收录该内容

46 篇文章 0 订阅

订阅专栏

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

3
7 20 88

Output

Input

9
16 20 30 40 50 60 70 80 90

Output

Input

9
15 20 30 40 50 60 70 80 90

Output

#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);
		else
		printf("90\n");
   	
	 }	
}