import sys
from math import gcd

def main():
    N, *rest = list(map(int, sys.stdin.read().split()))
    A = rest[:N]
    F = [a for a in A if a != 0]
    
    if len(F) <= 1:
        print("Yes")
        return
    
    # Check if all elements in F are equal
    all_equal = True
    first = F[0]
    for x in F[1:]:
        if x != first:
            all_equal = False
            break
    if all_equal:
        print("Yes")
        return
    
    F.sort()
    diffs = []
    for i in range(1, len(F)):
        diffs.append(F[i] - F[i-1])
    
    current_gcd = diffs[0]
    for d in diffs[1:]:
        current_gcd = gcd(current_gcd, d)
        if current_gcd == 0:
            break
    
    for d in diffs:
        if d % current_gcd != 0:
            print("No")
            return
    
    min_f = F[0]
    max_f = F[-1]
    t = (max_f - min_f) // current_gcd
    
    if t > N - 1:
        print("No")
    else:
        print("Yes")

if __name__ == "__main__":
    main()