#include <bits/stdc++.h>
using namespace std;
int main(){
    int N;
    cin >> N;
    vector<long long> A(N);
    for(int i = 0; i < N; i++) cin >> A[i];
    sort(A.begin(), A.end());
    long long g = -1;
    for(int i = 0; i < N; i++){
        if(A[i] == 0) continue;
        else if(i < N - 1){
            if(g == -1) g = A[i + 1] - A[i];
            else {
                if((g ==0 && A[i + 1] - A[i] != 0) || (g != 0 && A[i + 1] - A[i] == 0)){
                    cout << "No" << endl;
                    return 0;
                }
                g = gcd(g, A[i + 1] - A[i]);
            }
        }
    }
    if(g == 0){
        cout << "Yes" << endl;
        return 0;
    }
    long long cnt = 0;
    long long sz = 0;
    for(int i = 0; i < N; i++){
        if(A[i] == 0){
            cnt++;
            continue;
        }
        else if(i < N - 1){
            sz += (A[i + 1] - A[i]) / g - 1;
        }
    }
    if(sz <= cnt) cout << "Yes" << endl;
    else cout << "No" << endl;
}