## https://yukicoder.me/problems/no/1884

def calc_gcd(A, B):
    """
    正の整数A, Bの最大公約数を計算する
    """
    a = max(A, B)
    b = min(A, B)
    while a % b > 0:
        c = a % b
        a = b
        b = c
    return b


def main():
    N = int(input())
    A = list(map(int, input().split()))

    B = []
    zero = 0
    for a in A:
        if a == 0:
            zero += 1
        else:
            B.append(a)
    
    B.sort()
    if len(B) <= 2:
        print("Yes")
    else:
        if len(set(B)) < len(B):
            # 重複あり
            if len(set(B)) == 1:
                print("Yes")
            else:
                print("No")
        else:
            gcd = B[1] - B[0]

            for i in range(2, len(B)):
                gcd = calc_gcd(gcd, B[i] - B[i - 1])
            
            b_ = B[-1] - B[0]
            n = 1 + b_ // gcd
            if n - len(B) <= zero:
                print("Yes")
            else:
                print("No")








if __name__ == "__main__":
    main()