#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint N;
	cin >> N;
	vi v(N);
	vin(v);
	sort(all(v));

	lint a=0, b=0, c=0, x, y=0, z=0;
	rep(i, N) {
		if (!v[i]) a++;
		if (z) {
			z = __gcd(z, v[i]-v[i-1]);
		}
		if (b && v[i] == v[i-1]) y++;
		if (b && !z) z = v[i]-v[i-1];
		if (b == 0 && v[i]) b = v[i];
		c = v[i];
	}
	if (c != b && y) drop("No");
	if (!z) drop("Yes");
	x = (c-b)/z+1;
	if (x <= N) std::cout << "Yes" << '\n';
	else std::cout << "No" << '\n';
}