CodeForces 653A Bear and Three Balls

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, 5and 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

这道题就是判断有没有三个连续的数，开个数组把出现的数标记一下，然后for一遍就行了。

#include<stdio.h>  
#include<string.h>  
#include<algorithm>    
int a[60],b[1100];  
int main()  
{  	
	int i,n,flag;
    while(scanf("%d",&n)!=EOF)  
    {  
        for(i=0;i<n;i++)  
        {  
            scanf("%d",&a[i]);  
            b[a[i]]=1;  
        }  
        flag=0;  
        for(i=0;i<1001;i++)  
        {  
            if(b[i]==1&&b[i+1]==1&&b[i+2]==1)  
            {  
                printf("YES\n");  
                flag=1;  
                break;  
            }  
        }  
        if(flag==0)  
        printf("NO\n");  
    }  
    return 0;  
 }