#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main()
{
  int N;
  cin >> N;
  vector<ll> A(N);
  for (int i = 0; i < N; i++)
  {
    cin >> A.at(i);
  }

  vector<ll> C;
  for (int i = 0; i < N; i++)
  {
    if (A.at(i) != 0)
      C.push_back(A.at(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.at(i) = C.at(i + 1) - C.at(i);
  }

  int zerocnt = count(D.begin(), D.end(), 0LL);
  if (zerocnt > 0)
  {
    cout << (zerocnt == K - 1 ? "Yes" : "No") << endl;
    return 0;
  }

  ll g = 0;
  for (int i = 0; i < K - 1; i++)
  {
    g = gcd(g, D.at(i));
  }

  ll need = 0;
  for (int i = 0; i < K - 1; i++)
  {
    ll tmp = D.at(i) / g - 1;
    need += tmp;
  }

  cout << (need <= N - K ? "Yes" : "No") << endl;
}