import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

N = int(input())
A = li()

C = [a for a in A if a!=0]
C.sort()

if len(C) <= 1:
    exit(print("Yes"))

n = len(C)
if any(C[i]==C[i+1] for i in range(n-1)):
    if all(C[i]==C[i+1] for i in range(n-1)):
        exit(print("Yes"))
    else:
        exit(print("No"))

g = 0
for a,b in zip(C,C[1:]):
    g = gcd(g,b-a)

if max(C)-g*(N-1) <= min(C):
    print("Yes")
else:
    print("No")