#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;

using int64 = long long;
//const int mod = 1e9 + 7;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in: v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e: t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  int N;
  cin >> N;
  vector< int64 > Q(N);
  cin >> Q;
  int64 ret = infll;
  for(auto &p: Q) {
    if(p) chmin(ret, p);
  }
  if(ret == infll) {
    cout << "Yes\n";
    return 0;
  }
  vector< int64 > P;
  int64 c = 0;
  for(auto &p: Q) {
    if(p) P.emplace_back(p - ret);
    else c++;
  }
  int64 gcd = 0;
  for(auto &p: P) gcd = __gcd(p, gcd);
  int64 a = infll, b = -infll, d = 0;
  vector< int64 > ns;
  for(auto &p: P) {
    chmin(a, p);
    chmax(b, p);
    d++;
    ns.emplace_back(p);
  }
  auto l = set< int64 >(begin(ns), end(ns)).size();
  if(l == 1) {
    cout << "Yes\n";
    return 0;
  }
  if(l != ns.size()) {
    cout << "No\n";
    return 0;
  }
  int64 n = (b - a) / gcd + 1;
  if(n - d <= c) cout << "Yes\n";
  else cout << "No\n";
}