import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = (1<<63)-1
inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

from math import gcd

n = II()
aa = LI()
aa.sort()

g = 0
c0 = aa.count(0)

if c0 >= n-2:
    print("Yes")
    exit()

same = False
for i in range(c0, n-1):
    g = gcd(g, aa[i+1]-aa[i])
    if aa[i+1] == aa[i]: same = True

if g and same:
    print("No")
    exit()

if g == 0:
    print("Yes")
    exit()

cnt = 0
for i in range(c0, n-1):
    cnt += (aa[i+1]-aa[i])//g-1

print("Yes" if c0 >= cnt else "No")