#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
	ll n;
	cin>>n;
	vector<ll> a(n);
	ll cnt=0;
	for(int i=0;i<n;i++){
		cin>>a[i];
		if(a[i]==0)cnt++;
	}
	sort(a.begin(),a.end());
    ll k=0;
    for(int i=0;i<n-1;i++){
		if(a[i]!=0) k=max(k,a[i+1]-a[i]);
	}
	for(int i=0;i<n-1;i++){
		if(a[i]==0||a[i+1]==0) continue;
        if(a[i+1]==a[i]){k=0;break;}
		k=gcd(k,a[i+1]-a[i]);
	}
	ll z=0;
    if(k==0){
      for(int i=0;i<n-1;i++){
		if(a[i]==a[i+1]||(a[i]==0)) continue;
        cout<<"No"<<endl;
        return 0;
	  }
      cout<<"Yes"<<endl;
      return 0;
    }
	for(int i=0;i<n-1;i++){
		if(a[i]==0||a[i+1]==0) continue;
		z+=(a[i+1]-a[i])/k-1;
    }
	//cout<<k<<" "<<z<<endl;
	if(cnt>=z) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
}