#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  int n;
  cin>>n;
  vector<ll> A(n);
  rep(i,n) cin>>A[i];
  ll cnt=0;
  vector<ll> B;
  set<ll> s;
  rep(i,n){
    if(A[i]==0) cnt++;
    else{
      B.push_back(A[i]);
      s.insert(A[i]);
    }
  }
  if(s.size()<2) cout<<"Yes"<<endl;
  else if(s.size()!=n-cnt) cout<<"No"<<endl;
  else{
    sort(ALL(B));
    ll d=0;
    ll b=B.size();
    rep(i,b-1){
      d=gcd(d,B[i+1]-B[i]);
    }
    if(d==0) cout<<"Yes"<<endl;
    else{
      ll m=(B[b-1]-B[0])/d-1;
      if(m>n-2) cout<<"No"<<endl;
      else cout<<"Yes"<<endl;
    }
  }
   
  return 0;
}