#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 = 0;
  long long mn = 0;
  for (int i = 0; i < N - 1; i++){
    if (A[i] != 0){
      if (mn == 0){
        mn = A[i];
      }
      g = gcd(g, A[i + 1] - A[i]);
    }
  }
  if (mn == 0){
    mn = A[N - 1];
  }
  long long mx = A[N - 1];
  if (mn == 0){
    cout << "Yes" << endl;
  } else if (g == 0){
    cout << "Yes" << endl;
  } else {
    long long cnt = (mx - mn) / g + 1;
    if (cnt <= N){
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  }
}