#include <stdio.h>

void merge_sort(int n, long long x[])
{
	static long long y[200001] = {};
	if (n <= 1) return;
	merge_sort(n / 2, &(x[0]));
	merge_sort((n + 1) / 2, &(x[n/2]));
	
	int i, p, q;
	for (i = 0, p = 0, q = n / 2; i < n; i++) {
		if (p >= n / 2) y[i] = x[q++];
		else if (q >= n) y[i] = x[p++];
		else y[i] = (x[p] < x[q])? x[p++]: x[q++];
	}
	for (i = 0; i < n; i++) x[i] = y[i];
}

long long gcd(long long a, long long b)
{
	if (a == 0) return b;
	else return gcd(b % a, a);
}

int solve(int N, long long A[])
{
	int i;
	long long g;
	merge_sort(N, A);
	for (i = 0; i < N && A[i] == 0; i++);
	if (i >= N - 2) return 1;
	
	long long min = A[i], max = A[N-1];
	g = A[i+1] - A[i];
	for (i++; i < N - 1; i++) {
		if ((g == 0 && A[i+1] != A[i]) || (g != 0 && A[i+1] == A[i])) return 0;
		else if (g != 0) g = gcd(g, A[i+1] - A[i]);
	}
	if (g == 0 || (max - min) / g < N) return 1;
	else return 0;
}

int main()
{
	int i, N;
	long long A[200001];
	scanf("%d", &N);
	for (i = 0; i < N; i++) scanf("%lld", &(A[i]));
	if (solve(N, A) == 0) printf("No\n");
	else printf("Yes\n");
	fflush(stdout);
	return 0;
}