ll@n,@a[n];
sortF(n,a);
ll s=0;
while(s<n&&!a[s])++s;
if(s>n-2){
	wt("Yes");
	exit(0);
}
if(a[s]==a[n-1]){
	wt("Yes");
	exit(0);
}
ll g=a[s+1]-a[s];
rep(i,s+1,n-1){
	g=gcd(g,a[i+1]-a[i]);
}
ll m=0;
rep(i,s,n-1){
	if(a[i+1]==a[i]){
		wt("No");
		exit(0);
	}
	m+=(a[i+1]-a[i])/g-1;
}
if(m>s){
	wt("No");
}else{
	wt("Yes");
}