#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

int main() {
  int N; cin >> N;
  vector<ll> A(N);
  for (int i = 0; i < N; i++) cin >> A[i];
  vector<ll> C;
  for (int i = 0; i < N; i++) {
    if (A[i] != 0) C.push_back(A[i]);
  }
  int K = C.size();
  if (K == 0) {
    cout << "Yes" << endl;
    return 0;
  }
  sort(C.begin(), C.end());
  vector<ll> D(K - 1);
  for (int i = 0; i < K - 1; i++) {
    D[i] = C[i + 1] - C[i];
  }
  int cnt = count(D.begin(), D.end(), 0LL);
  if (cnt > 0) {
    cout << (cnt == K - 1 ? "Yes": "No") << endl;
    return 0;
  }
  ll g = 0;
  for (int i = 0; i < K - 1; i++) {
    g = gcd(g, D[i]);
  }
  ll need = 0;
  for (int i = 0; i < K - 1; i++) {
    ll tmp = D[i] / g - 1;
    need += tmp;
  }
  cout << (need <= N - K ? "Yes": "No") << endl;
  return 0;
}