2393.Bear and Three Balls

Time Limit: 1s Memory Limit: 256MB

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 Format(From the terminal/stdin)

The first line of the input contains one integer n (3 \le n \le 50)- the number of balls Limak has.

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

Output Format(To the terminal/stdout)

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).

Sample Input 1

Copy
4
18 55 16 17
 \n
  ·  ·  ·  \n

Sample Output 1

Copy
YES
   \n

Sample Input 2

Copy
6
40 41 43 44 44 44
 \n
  ·  ·  ·  ·  ·  \n

Sample Output 2

Copy
NO
  \n

Sample Input 3

Copy
8
5 972 3 4 1 4 970 971
 \n
 ·   · · · · ·   ·   \n

Sample Output 3

Copy
YES
   \n

Hints

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:
Choose balls with sizes 3, 4 and 5. Choose balls with sizes 972, 970, 971.

Submit

请先 登录

© 2025 FAQs