#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());
  vector<long long> B;
  int cnt0 = 0;
  for (int i = 0; i < N - 1; i++) {
    if (A[i] != 0) {
      B.push_back(A[i + 1] - A[i]);
    } else {
      cnt0++;
    }
  }
  sort(B.begin(), B.end());
  bool ok = false;
  if (B.empty()) {
    ok = true;
  } else if (B[0] == 0) {
    if (B.back() == 0) {
      ok = true;
    }
  } else {
    long long g = B[0];
    for (int i = 0; i < B.size(); i++) {
      g = __gcd(g, B[i]);
    }
    long long c = 0;
    for (int i = 0; i < B.size(); i++) {
      c += B[i] / g - 1;
    }
    if (cnt0 >= c) {
      ok = true;
    }
  }
  if (ok) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}