跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1094. Filya and Homework

    ID: 1100 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 2 上传者: 标签>模拟排序编程与模拟基础难度共享题库Codeforces英文题面题目来源题面语言

Filya and Homework

题目描述

B. Filya and Homework
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Today, hedgehog Filya went to school for the very first time! Teacher gave him a homework which Filya was unable to complete without your help.

Filya is given an array of non-negative integers a1,a2,...,an. First, he pick an integer x and then he adds x to some elements of the array (no more than once), subtract x from some other elements (also, no more than once) and do no change other elements. He wants all elements of the array to be equal.

Now he wonders if it's possible to pick such integer x and change some elements of the array using this x in order to make all elements equal.

Input

The first line of the input contains an integer n (1≤n≤100000)− the number of integers in the Filya's array. The second line contains n integers a1,a2,...,an (0≤ai≤109)− elements of the array.

Output

If it's impossible to make all elements of the array equal using the process given in the problem statement, then print "NO" (without quotes) in the only line of the output. Otherwise print "YES" (without quotes).

Examples
Input
5
1 3 3 2 1
Output
YES
Input
5
1 2 3 4 5
Output
NO
Note

In the first sample Filya should select x=1, then add it to the first and the last elements of the array and subtract from the second and the third elements.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 558 题。保留原作者与原赛事署名。