#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define Inf 1000000001


int main(){
	
	int n;
	cin>>n;
	
	vector<long long> a(n);
	rep(i,n){
		cin>>a[i];
	}
	sort(a.begin(),a.end());
	if(a.back()==0 || a[n-2]==0){
		cout<<"Yes"<<endl;
		return 0;
	}
	int zero = 0;
	rep(i,n){
		if(a[i]==0)zero++;
	}
	long long g = 0;
	rep(i,n){
		if(a[i]==0)continue;
		g = gcd(g,a.back()-a[i]);
	}
	long long m = a.back();
	long long M = a.back();
	if(m==M){
		cout<<"Yes"<<endl;
		return 0;
	}
	rep(i,a.size()){
		if(a[i]!=0)m = min(a[i],m);
	}
	vector<long long> y;
	for(long long i=1;i*i<=g;i++){
		if(g%i==0){
			y.push_back(i);
			if(i*i!=g)y.push_back(g/i);
		}
	}
	
	rep(i,y.size()){
		long long T = a.back() - m;
		T /= y[i];
		T ++;
		T -= (n-zero);
		if(T<=zero){
			cout<<"Yes"<<endl;
			return 0;
		}
	}
	cout<<"No"<<endl;
	
	return 0;
}