B. Filya and Homework

Description

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 a 1, a 2, …, a n. 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 ≤ 100 000) — the number of integers in the Filya’s array. The second line contains n integers a 1, a 2, …, a n (0 ≤ a i ≤ 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

题目意思是：判断一个整形数组中是否有这样一个数num，数组中的元素加上一个或减去一个num，如果最后能使所有数组元素相等，输出YES，否则，输出NO。但是注意：上述加或者减的操作只能进行一次。

解题思路：题目看似复杂，实际上，如果要满足数组元素一加一减后便能全部相等，那么这个数组中的元素最多只能有三组不相等的元素。并且，中间值的两倍要等与最大值和最小值的两倍。

解题步骤：

1. 将数组由小到大排序（可用c函数库的qsort()函数进行排序）
2. 对数组元素进行去重操作（看下面代码）
3. 比较大小

去重代码：

	int arr [ 100 ] ;
    int sum = 1 ;
    for ( int i = 1 ; i < n ; i++ )
    {
        if ( arr [ i ] != arr [ i - 1 ] )
        {
            f [ sum ] = f [ i ] ;
            sum++ ;
        }
    }

AC代码：

#include<stdio.h>
#include<stdlib.h>
int cmp( const void * a , const void * b )
{
    return * ( int * ) a - * ( int * ) b ;
}

int main ( void )
{
    int f [ 100005 ] ;
    int n , i , sum ;
    scanf( "%d" , &n ) ;

    for ( i = 0 ; i < n ; i++ )
        scanf( "%d" , f + i ) ;

    qsort( f , n , sizeof( f [ 0 ] ) , cmp ) ;//对数组进行排序

    sum = 1 ;  //数组去重操作
    for ( i = 1 ; i < n ; i++ )
    {
        if ( f [ i ] != f [ i - 1 ] )
        {
            f [ sum ] = f [ i ] ;
            sum++ ;
        }
    }

    if ( sum <= 2 ) //当数组中只有两组或者一组不同大小的元素时也成立
        printf( "YES\n" ) ;
    else
    {
        if ( sum == 3 && f [ 2 ] + f [ 0 ] == 2 * f [ 1 ] )
            printf( "YES\n" ) ;
        else
            printf( "NO\n" ) ;
    }

    return 0 ;
}