from collections import defaultdict, deque, Counter
from heapq import heapify, heappop, heappush
import math
from copy import deepcopy
from itertools import combinations, permutations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right

import sys

def input():
    return sys.stdin.readline().rstrip()
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getListGraph():
    return list(map(lambda x:int(x) - 1, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]

mod = 10 ** 9 + 7
MOD = 998244353
sys.setrecursionlimit(10000000)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
inf = float('inf')
eps = 10 ** (-15)
dy = [0, 1, 0, -1]
dx = [1, 0, -1, 0]

#############
# Main Code #
#############

"""
等差数列
gcdする　距離を保ったまま置くことは可能か
順番は一定 ソートする
"""

N = getN()
A = sorted([i for i in getList() if i != 0])

# 全て同じ
if all([(a == A[0]) for a in A]):
    print('Yes')
    exit()

if len(A) != len(set(A)):
    print('No')
    exit()

g = 0
for i in range(len(A) - 1):
    g = math.gcd(g, A[i + 1] - A[i])
ans = 1
for i in range(len(A) - 1):
    ans += (A[i + 1] - A[i]) // g

if ans <= N:
    print('Yes')
else:
    print('No')