CF673A.Bear and Game

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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_{1},t_{2},...,t_{n}$ . Your task is to calculate for how many minutes Limak will watch the game.

输入格式

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_{1},t_{2},...,t_{n}$ ( 1<=t_{1}<t_{2}<...\ t_{n}<=90 ), given in the increasing order.

输出格式

Print the number of minutes Limak will watch the game.

输入输出样例

输入#1
```
3
7 20 88
```
输出#1
```
35
```
输入#2
```
9
16 20 30 40 50 60 70 80 90
```
输出#2
```
15
```
输入#3
```
9
15 20 30 40 50 60 70 80 90
```
输出#3
```
90
```

说明/提示

In the first sample, minutes $21,22,...,35$ are all boring and thus Limak will turn TV off immediately after the $35$ -th minute. So, he would watch the game for $35$ minutes.

In the second sample, the first $15$ minutes are boring.

In the third sample, there are no consecutive $15$ boring minutes. So, Limak will watch the whole game.

首页