#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define ALL(x) (x).begin(), (x).end()

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
struct edge {
    int to, cost, id;
};
const double PI = 3.14159265358979323846;
const double PI2 = PI * 2.0;
const double EPS = 1E-09;
const ll MOD = 1E+09 + 7; // =998244353;
const ll INFL = 1E18;
const int INFI = 1E09;
const int MAX_N = 2E+05;

ll dx[4] = { -1, 1, 0, 0 }, dy[4] = { 0, 0, -1, 1 };

int N;

ll A[MAX_N + 1];

template <typename T>
T gcd(T a, T b)
{
    if (b == 0)
        return a;

    return gcd(b, a % b);
}

vector<ll> divisor(ll n)
{
    vector<ll> ans;
    for (ll i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            ans.push_back(i);
            if (i * i != n)
                ans.push_back(n / i);
        }
    }
    return ans;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N;

    map<ll, int> mp;
    vector<ll> a;
    bool db = false;

    for (int i = 1; i <= N; i++) {
        cin >> A[i];
        if (A[i] > 0) {
            a.push_back(A[i]);
            if (mp[A[i]] > 0) {
                db = true;
            }
            mp[A[i]]++;
        }
    }

    sort(ALL(a));

    bool ans = false;
    if (a.size() <= 1) {
        ans = true;
    } else if (db) {
        ans = true;
        for (int i = 0; i + 1 < a.size(); ++i) {
            if (a[i] != a[i + 1])
                ans = false;
        }
    } else {

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

        auto d = divisor(g);

        for (ll dd : d) {
            if ((a.back() - a[0]) / dd + 1 <= N) {
                ans = true;
                break;
            }
        }
    }

    // for (int i = 0; i < N; i++) {
    //     for (int j = 0; j < N; j++) {
    //         cout << "i = " << i << ", j = " << j << ", dp = " << dp[i][j] << "\n";
    //     }
    // }

    cout << (ans ? "Yes" : "No") << "\n";

    return 0;
}