#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N; cin >> N;
    int Z = 0;
    vector<int> A;
    rep(i,N) {
        int a; cin >> a;
        if(a == 0) Z++;
        else A.push_back(a);
    }

    if(N - Z <= 2) {
        cout << "Yes" << endl;
        return 0;
    }

    sort(A.begin(), A.end());
    N = A.size();
    auto B = A;
    B.erase(unique(B.begin(), B.end()), B.end());
    if(A.size() != B.size()){
        if(A[0] == A.back()) {
            cout << "Yes" << endl;
        } else {
            cout << "No" << endl;
        }
        return 0;
    }
    int G = 0;
    rep(i,N-1) G = gcd(G, A[i + 1] - A[i]);
    rep(i,N-1) {
        Z -= (A[i + 1] - A[i]) / G - 1;
    }
    cout << (Z >= 0 ? "Yes" : "No") << endl;
}