CF653A.Bear and Three Balls

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Limak is a little polar bear. He has nn balls, the ii -th ball has size tit_{i} .

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

For example, Limak can choose balls with sizes 44 , 55 and 33 , or balls with sizes 9090 , 9191 and 9292 . But he can't choose balls with sizes 55 , 55 and 66 (two friends would get balls of the same size), and he can't choose balls with sizes 3030 , 3131 and 3333 (because sizes 3030 and 3333 differ by more than 22 ).

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

输入格式

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

The second line contains nn integers t1,t2,...,tnt_{1},t_{2},...,t_{n} ( 1<=ti<=10001<=t_{i}<=1000 ) where tit_{i} denotes the size of the ii -th ball.

输出格式

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

输入输出样例

  • 输入#1

    4
    18 55 16 17
    

    输出#1

    YES
    
  • 输入#2

    6
    40 41 43 44 44 44
    

    输出#2

    NO
    
  • 输入#3

    8
    5 972 3 4 1 4 970 971
    

    输出#3

    YES
    

说明/提示

In the first sample, there are 44 balls and Limak is able to choose three of them to satisfy the rules. He must must choose balls with sizes 1818 , 1616 and 1717 .

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 33 , 44 and 55 .
  2. Choose balls with sizes 972972 , 970970 , 971971 .
首页