codeforces 653A Bear and Three Balls

A. Bear and Three Balls

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Limak is a little polar bear. He has n balls, the i-th ball has size ti.

Limak wants to give one ball to each of his three friends. Giving gifts isn't easy — there are two rules Limak must obey to make friends happy:

• No two friends can get balls of the same size.
• No two friends can get balls of sizes that differ by more than 2.

For example, Limak can choose balls with sizes 4, 5 and 3, or balls with sizes 90, 91 and 92. But he can't choose balls with sizes 5, 5 and 6 (two friends would get balls of the same size), and he can't choose balls with sizes 30, 31 and 33 (because sizes 30 and 33 differ by more than 2).

Your task is to check whether Limak can choose three balls that satisfy conditions above.

Input

The first line of the input contains one integer n (3 ≤ n ≤ 50) — the number of balls Limak has.

The second line contains n integers t1, t2, ..., tn (1 ≤ ti ≤ 1000) where ti denotes the size of the i-th ball.

Output

Print "YES" (without quotes) if Limak can choose three balls of distinct sizes, such that any two of them differ by no more than 2. Otherwise, print "NO" (without quotes).

Examples

input

4
18 55 16 17

output

YES

input

6
40 41 43 44 44 44

output

NO

input

8
5 972 3 4 1 4 970 971

output

YES

Note

In the first sample, there are 4 balls and Limak is able to choose three of them to satisfy the rules. He must must choose balls with sizes 18, 16 and 17.

In the second sample, there is no way to give gifts to three friends without breaking the rules.

In the third sample, there is even more than one way to choose balls:

1. Choose balls with sizes 3, 4 and 5.
2. Choose balls with sizes 972, 970, 971

题意：给一组数，送给朋友三个气球，要求1、任意两个朋友的数的差不能大于2， 2、任意两个朋友的数不能相等

题解：找到连续的三个数即可

#include<stdio.h>
#include<string.h>
#include<queue>
#include<cstdio>
#include<string>
#include<math.h>
#include<algorithm>
#define LL long long
#define PI atan(1.0)*4
#define DD double
#define MAX 6000
#define mod 100
#define dian 1.000000011
#define INF 0x3f3f3f
using namespace std;
int s[MAX];
int a[MAX];
int ans[MAX],op[MAX];
int main()
{
	int n,m,j,i,t,k,o,l;
    while(scanf("%d",&n)!=EOF)
    {
    	for(i=1;i<=n;i++)
    	    scanf("%d",&s[i]);
    	sort(s+1,s+n+1);
    	int flag=0;
    	k=1;
    	for(i=1;i<n;i++)
    	{
    	    j=i;
    	    while(s[j]==s[j+1])
    	    	j++;
    	    a[k++]=s[j];
    	    i=j;
    	}
    	if(s[n-1]!=s[n]) a[k++]=s[n];
    	for(i=3;i<=k;i++)
    	{
    		if(a[i]==a[i-1]+1&&a[i-1]==a[i-2]+1)
    		{
    			flag=1;
    			break;
    		}
    	}
    	if(flag) printf("YES\n");
    	else printf("NO\n");
    }
	return 0;
}