import sys
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
#MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]

def main():
    N = int(input())
    A = list(map(int,input().split()))
    X = []
    for a in A:
        if a == 0: continue
        X.append(a)
    X.sort()
    if len(X) <= 1:
        print('Yes');exit()
    if len(set(X)) == 1:
        print('Yes');exit()
    if len(set(X)) < len(X):
        print('No');exit()
    M = len(X)
    for i in range(M-1):
        if i == 0:
            g = X[1] - X[0]
        else:
            g = math.gcd(g, X[i+1] - X[i])
    
    num = 0
    for i in range(M-1):
        num += ((X[i+1] - X[i]) // g) - 1 #間の数なので植木算
    #print(num)
    zeros = N - M
    if zeros >= num:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()