#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
lint gcd(lint a, lint b) {
  if(a < b) {
    swap(a, b);
  }
  while(b > 0) {
    lint r = a % b;
    a = b;
    b = r;
  }
  return a;
}
lint lcm(lint a, lint b) {
  return a * b / gcd(a, b);
}
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int N;
  cin >> N;
  vector<lint> A;
  REP(i, N) {
    lint a;
    cin >> a;
    if(a != 0) A.push_back(a);
  }
  if(A.size() <= 1) {
    cout << "Yes" << endl;
    return 0;
  }
  sort(ALL(A));
  lint g = A[1] - A[0];
  bool zero = g == 0;
  FOR(i, 1, A.size()-1) {
    if(A[i+1] - A[i] == 0) zero = true;
    if(zero) break;
    g = gcd(g, A[i+1] - A[i]);
  }
  if(zero) {
    bool ok = true;
    FOR(i, 1, A.size()) if(A[0] != A[i]) ok = false;
    yes(ok);
    return 0;
  }
  yes((A[A.size()-1] - A[0]) / g + 1 <= N);
}