CF128D.Numbers

普及/提高-

通过率:0%

AC君温馨提醒

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

题目描述

One day Anna got the following task at school: to arrange several numbers in a circle so that any two neighboring numbers differs exactly by 1. Anna was given several numbers and arranged them in a circle to fulfill the task. Then she wanted to check if she had arranged the numbers correctly, but at this point her younger sister Maria came and shuffled all numbers. Anna got sick with anger but what's done is done and the results of her work had been destroyed. But please tell Anna: could she have hypothetically completed the task using all those given numbers?

输入格式

The first line contains an integer nn — how many numbers Anna had ( 3<=n<=1053<=n<=10^{5} ). The next line contains those numbers, separated by a space. All numbers are integers and belong to the range from 11 to 10910^{9} .

输出格式

Print the single line "YES" (without the quotes), if Anna could have completed the task correctly using all those numbers (using all of them is necessary). If Anna couldn't have fulfilled the task, no matter how hard she would try, print "NO" (without the quotes).

输入输出样例

  • 输入#1

    4
    1 2 3 2
    

    输出#1

    YES
    
  • 输入#2

    6
    1 1 2 2 2 3
    

    输出#2

    YES
    
  • 输入#3

    6
    2 4 1 1 2 2
    

    输出#3

    NO
    
首页