#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long gcd(long long a, long long b) {
	if (b == 0) return a;
	else return gcd(b, a%b);
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	int count = 0;
	vector<long long>v;
	rep(i, n) {
		long long a; cin >> a;
		if (0 == a)count++;
		else v.push_back(a);
	}
	sort(all(v));
	if (v[0] == v.back()) {
		cout << "Yes" << endl;
		return 0;
	}
	if (v.size() <= 1) {
		cout << "Yes" << endl;
		return 0;
	}
	{
		bool chk = true;
		rep(i, v.size() - 1) {
			if (v[i] == v[i + 1])chk = false;
		}
		if (!chk)cout << "No" << endl;
	}
	long long g = 0;
	rep(i, v.size() - 1) g = gcd(g, v[i + 1] - v[i]);
	long long sz = (v.back() - v[0]) / g - ((long long)v.size() - 1);
	//cout << (v.back() - v[0]) / g << endl;
	//cout << sz << endl;
	//cout << g << endl;
	if (sz <= (long long)count)cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}