Bear and Three Balls

题目链接

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.

题解：

用flag标记某个数字是否出现，然后从0遍历到1000，看是否有三个连续的数被标记。

一开始，我直接用的sort排序，然后遍历看是否有三个连续的数，结果没ac，看了网上的题解，发现换个方法也可以，也挺简单。

//#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>

using namespace std;

typedef long long ll;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f3f;

bool flag[2000];

int main()
{	
//	freopen("input.txt","r",stdin); //提交时关闭
//	std::ios::sync_with_stdio(false);

	memset(flag,0,sizeof(flag));
	int n;
	cin>>n;
	int x;
	for(int i=0;i<n;i++) 
	{
		cin>>x;
		flag[x]=1;
	}
	for(int i=0;i<1000;i++)
	{
		if(flag[i]==1&flag[i+1]==1&&flag[i+2]==1)
		{
			cout<<"YES";
			return 0;
		}
	}
	cout<<"NO";
	

	return 0;
}

不是尽力而为，而是全力以赴，必须做到。