import sys,bisect
input=lambda:sys.stdin.readline().rstrip()
def gcd(a,b):
	m,M=min(a,b),max(a,b)
	return M if m==0 else gcd(m,M%m)
N=int(input())
A=sorted(list(map(int,input().split())))
ind=bisect.bisect_right(A,0)
d,flg=0,0
for i in range(ind,N-1):
	d=gcd(d,A[i+1]-A[i])
	flg|=A[i]==A[i-1]
if d==0:
	print('Yes')
elif flg:
	print('No')
else:
	print(['Yes','No'][(A[-1]-A[ind])//d+1-N>0])