/* -*- coding: utf-8 -*-
 *
 * 1884.cc:  No.1884 Sequence - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const long long LINF = 1LL << 62;

/* typedef */

typedef long long ll;

/* global variables */

ll as[MAX_N], ds[MAX_N];

/* subroutines */

template <typename T>
T gcd(T m, T n) {  // m >= 0, n >= 0
  if (m < n) swap(m, n);
  while (n > 0) {
    T r = m % n;
    m = n;
    n = r;
  }
  return m;
}

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n; i++) {
    scanf("%lld", as + i);
    if (as[i] == 0) as[i] = LINF;
  }
  sort(as, as + n);

  int m = 0, c = 0;
  for (ll pa = 0; m < n && as[m] < LINF; m++)
    if (pa != as[m]) pa = as[m], c++;
  //printf("m=%d\n", m);

  if (m <= 2 || c == 1) { puts("Yes"); return 0; }

  ll g = 0;
  for (int i = 0; i + 1 < m; i++) {
    ds[i] = as[i + 1] - as[i];
    if (ds[i] == 0) { puts("No"); return 0; }
    g = gcd(g, ds[i]);
  }
  //printf("g=%lld\n", g);

  int r = n - m;
  for (int i = 0; i + 1 < m; i++) {
    ll q = ds[i] / g - 1;
    if (q > r) { puts("No"); return 0; }
    r -= q;
  }

  puts("Yes");
  return 0;
}