from math import gcd
N = int(input())
A = list(map(int,input().split()))
B = []
for i in range(N):
    if A[i] != 0:
        B.append(A[i])
B.sort()
M = len(B)
Z = N - M
G = 0
for i in range(M-1):
    G = gcd(G, B[i+1] - B[i])
cnt = 0
if G > 0:
    for i in range(M-1):
        cnt += (B[i+1] - B[i]) // G - 1
if cnt <= Z:
    print('Yes')
else:
    print('No')