from math import gcd
import sys
input = sys.stdin.readline

def solve():
    N=int(input())
    A=list(map(int,input().split()))
    if len(set(A)-set([0]))<=1:return True
    A.sort()
    cnt0=0
    d_lst = []
    for i in range(N-1):
        if A[i]==0:
            cnt0+=1
            continue
        d = A[i+1]-A[i]
        d_lst.append(d)
    d_min = min(d_lst)
    if d_min==0:
        return False
    g = d_lst[0]
    for i in range(1,len(d_lst)):g=gcd(g,d_lst[i])
    for d in d_lst:
        cnt0 -= d//g-1
    return cnt0>=0

print("Yes" if solve() else "No")