#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    ll N, M=0, a, g=0;
    cin >> N;
    vector<ll> A;
    for (int i=0; i<N; i++){
        cin >> a;
        if (a == 0) M++;
        else A.push_back(a);
    }
    sort(A.begin(), A.end());
    if (A.size() <= 1){
        cout << "Yes" << endl;
    }

    for (int i=1; i<A.size(); i++){
        g = gcd(g, A[i]-A[i-1]);
    }

    if (g == 0){
        bool f=1;
        for (int i=1; i<A.size(); i++) if (A[i] != A[0]) f=0;
        cout << (f ? "Yes" : "No") << endl;
        return 0;
    }

    set<ll> st;
    for (int i=0; i<A.size(); i++){
        if (st.count(A[i])){
            cout << "No" << endl;
            return 0;
        }
        st.insert(A[i]);
    }

    cout << (A.back()/g - A[0]/g + 1 <= A.size() + M ? "Yes" : "No") << endl;

    return 0;
}