/*yukicoder No.1884 Sequence*/
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;

//ユークリッドの互除法(x<y)
ll gojyohou(ll x,ll y){
  ll a=y%x;
  if(a){//a!=0
    return gojyohou(a,x);
  }else{//a==0
    return x;
  }
}

int main(){
  int n,zero=0;
  vector<ll> A(0);
  cin>>n;
  while(n--){
    int i;
    cin>>i;
    if(i){//i!=0
      A.push_back(i);
    }else{//i==0
      zero++;
    }
  }
  n=A.size();
  if(n<3){
    printf("Yes\n");
    return 0;
  }
  sort(A.begin(),A.end());//小さい順に
  for(int i=1;i<n;i++){
    if(A.at(i-1)==A.at(i)){
      if(A.at(0)==A.at(n-1))cout<<"Yes\n";else cout<<"No\n";
      return 0;
    }
  }
  for(int i=1;i<n;i++){
    A.at(i)-=A.at(0);
  }
  ll gcd=gojyohou(A.at(1),A.at(2));
  for(int i=3;i<n;i++){
    gcd=gojyohou(gcd,A.at(i));
  }
  int needs=A.at(n-1)/gcd+1-n;
  if(needs<=zero)cout<<"Yes\n";else cout<<"No\n";
  //cout<<gcd;
  return 0;
}