#include <bits/stdc++.h>
using namespace std;
//#include<atcoder/all>
//using namespace atcoder;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
constexpr ll MAX = 2000000000000000000;
constexpr ld PI = 3.14159265358979;
constexpr ll MOD = 998244353;//2024948111;
ld dotorad(ld K){ return PI * K / 180.0; }
ld radtodo(ld K){ return K * 180.0 / PI; }
mt19937 mt;
void randinit(){ srand((unsigned)time(NULL));mt = mt19937(rand()); }

int main(){
    ll N;
    cin >> N;
    vector<ll> A(N);
    for(ll i = 0; i < N; i++) cin >> A[i];
    sort(A.begin(),A.end());
    ll zero_cnt = 0;
    for(ll i = 0; i < N; i++){
        if(A[i] == 0) zero_cnt++;
    }
    if(zero_cnt >= N - 1){
        cout << "Yes" << endl;
        return 0;
    }
    ll mi = MAX,ma = -MAX;
    unordered_map<ll,ll> mp;
    for(ll i = 0; i < N; i++){
        if(A[i] != 0){
            mi = min(mi,A[i]);
            ma = max(ma,A[i]);
            mp[A[i]]++;
        }
    }
    if(ma == mi){
        cout << "Yes" << endl;
        return 0;
    }
    for(ll i = 0;i < N;i++){
        if((ma - mi) % (i + 1) != 0) continue;
        ll d = (ma - mi) / (i + 1);
        ll nokori = zero_cnt,used = 0;
        bool ok = 1;
        for(ll i = zero_cnt;i < N;i++){
            if(A[i] % d != mi % d){
                ok = 0;
                break;
            }
        }
        if(!ok) continue;
        for(ll x = mi;x <= ma;x += d){
            if(mp[x] == 0){
                nokori--;
            }
            else{
                used++;
            }
        }
        if(nokori >= 0 && used == N - zero_cnt){
            cout << "Yes" << endl;
            return 0;
        }
    }
    cout << "No" << endl;
}