#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using ll = long long;
using mint = atcoder::modint1000000007;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,a,b) for (int i = a; i < b; i++)
#define rrep2(i,a,b) for (int i = a-1; i >= b; i--)
#define rep3(i,a,b,c) for (int i = a; i < b; i+=c)
#define rrep3(i,a,b,c) for (int i = a-1; i >= b; i-=c)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}
template<class T> T power(T x, ll y){if (y == 0) return 1;T p = pow(x,y/2);if (y%2 == 0) return p*p;else return p*p*x;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    vector<ll> A(n);
    rep(i,n) cin >> A[i];
    sort(all(A));
    ll z = 0;
    vector<ll> v;
    rep(i,n-1){
        if (A[i] != 0) v.push_back(A[i+1]-A[i]);
        else z++;
    }
    ll g = 0, cnt = 0;
    bool f = false;
    for (auto x:v){
        if (x == 0) f = true;
        if (x != 0 && f){
            cout << "No" << endl;
            return 0;
        }
        g = gcd(g,x);
    }
    if (g == 0){
        cout << "Yes" << endl;
        return 0;
    }
    for (auto x:v) cnt += x/g-1;
    cout << (z>=cnt?"Yes":"No") << endl;
}