#include <bits/stdc++.h>
using namespace std;

#ifdef _RUTHEN
#include "debug.hpp"
#else
#define show(...) true
#endif

using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> using V = vector<T>;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N;
    cin >> N;
    V<ll> A(N);
    rep(i, N) cin >> A[i];
    V<ll> B;
    rep(i, N) {
        if (A[i] != 0) B.push_back(A[i]);
    }
    int M = B.size();
    int c = N - M;
    sort(B.begin(), B.end());
    int ok = 1;
    rep(i, M - 1) {
        if (B[i] == B[i + 1]) {
            ok = 0;
        }
    }
    if (ok == 0) {
        // check
        int ok2 = 1;
        rep(i, M) {
            if (B[0] != B[i]) ok2 = 0;
        }
        cout << (ok2 ? "Yes" : "No") << '\n';
        return 0;
    }
    if (M <= 1) {
        cout << "Yes" << '\n';
        return 0;
    }
    // M >= 2
    ll g = B[1] - B[0];
    rep(i, M - 1) g = gcd(g, B[i + 1] - B[i]);
    ll c2 = 0;
    rep(i, M - 1) {
        c2 += (B[i + 1] - B[i]) / g - 1;
        if (c2 > c) {
            ok = 0;
            break;
        }
    }
    cout << (ok ? "Yes" : "No") << '\n';
    return 0;
}