去重函数unique

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

Copy

4
18 55 16 17

output

Copy

YES

input

Copy

6
40 41 43 44 44 44

output

Copy

NO

input

Copy

8
5 972 3 4 1 4 970 971

output

Copy

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.

3. #include<iostream>
   #include<algorithm>
   using namespace std;
   int main()
   {
   	int n;
   	int t[1000];
   	while(cin>>n)
   	{
   		int flag=0;
   		for(int i=0;i<n;i++) cin>>t[i];
   		sort(t,t+n);
   		int tmp = unique(t,t+n)-t;//去掉这个就不对了我也不知道为什么，减t因为这个函数返回的就是地址，所以要减去，而tmp这个变量里存的就是去重之后的数组的长度，
   		for(int i=1;i<tmp-1;i++)
   		{
   			if((t[i]-t[i-1]==1)&&(t[i]+1==t[i+1]))
   		        {flag=1;break;}
   		}
   		if(flag) cout<<"YES"<<endl;
   		else cout<<"NO"<<endl;
   	}
   	return 0;
   }

   unique是STL中很实用的函数之一，需要#include<iostream>，下面来简单介绍一下它的作用。

   unique的作用是“去掉”容器中相邻元素的重复元素，这里去掉要加一个引号，为什么呢，是因为它实质上是一个伪去除，它会把重复的元素添加到容器末尾，而返回值是去重之后的尾地址（是地址！！），举个例子：

   [cpp]  view plain  copy

   1. int num[10]={1,1,2,2,2,3,4,5,5,5};  
   2. int ans=unique(num,num+10)-num;  

   这时，返回的ans是5，而num中前5项就是1,2,3,4,5，一般使用前需要对容器进行排序，这样才能实现对整个数组去重。

   另：如果要对结构体进行这一操作，需要重载运算符"=="，具体要根据自己需要重载。