from math import gcd
N = int(input())
A = list(map(int,input().split()))
A.sort()
c0 = 0
pre = 0
D = []
A2 = []
for a in A:
    if a == 0:
        c0 += 1
    else:
        A2.append(a)
        if pre != 0:
            D.append(a - pre)
        pre = a
N2 = len(A2)
if N2 == 0 or len(D) <= 1:
    print("Yes")
    exit()

amin= min(A2)
amax = max(A2)
if amin == amax:
    print("Yes")
    exit()

dmin= min(D)
dmax = max(D)
if dmin == 0 and dmax > 0:
    print("No")
    exit()

n0 = N - c0
g = 0
D.sort(reverse= True)
for d in D:
    g = gcd(g,d)
x = (amax - amin) // g + 1
if N >= x:
    print("Yes")
else:
    print("No")