#include<bits/stdc++.h>
using namespace std;
constexpr int Inf = 2000000000;
constexpr long long INF= 2000000000000000000;

template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }

template<typename T,typename U>
T modpow(T N, U P, T M = -1) {
    if(P < 0) return 0;
    T ret = 1;
    if(M != -1) ret %= M;
    while(P) {
        if(P & 1) {
            if(M == -1) ret *= N;
            else ret = ret * N % M;
        }
        P /= 2;
        if(M == -1) N *= N;
        else N = N * N % M;
    }
    return ret;
}

constexpr long long MOD = 998244353;

int main() {
    int n;
    cin >> n;
    vector<long long> vec;
    long long free_card = 0;
    for(int i = 0;i < n;i++) {
        long long a;
        cin >> a;
        if(a != 0) vec.push_back(a);
        else free_card++;
    }

    sort(vec.begin(),vec.end());
    if(free_card >= n - 1) {
        cout << "Yes" << endl;
        return 0;
    }

    long long min_gcd = vec[1] - vec[0];
    for(int i = 1;i < vec.size() - 1;i++) {
        min_gcd = gcd(min_gcd,vec[i + 1] - vec[i]);
    }

    if(min_gcd == 0) {
        if(all_of(vec.begin(),vec.end(),[&](long long a){return a == vec[0];})) cout << "Yes" << endl;
        else cout << "No" << endl;
        return 0;
    }

    long long free_count = 0;
    for(int i = 0;i < vec.size() - 1;i++) {
        free_count += (vec[i + 1] - vec[i]) / min_gcd - 1;
    }

    if(free_count <= free_card) cout << "Yes" << endl;
    else cout << "No" << endl;
}