#include <iostream> #include <vector> #include <map> #include <algorithm> #include <cmath> #include <iomanip> #include <string> #include <list> #include <cassert> #include <numeric> #include <cstdint> #include <queue> #include <deque> #include <stack> #include <set> #include <random> // #include <atcoder/all> using ll = long long; using ld = long double; using namespace std; // using namespace atcoder; using P = pair<ll, ll>; using Graph = vector<vector<int>>; using Priority = priority_queue<ll, vector<ll>, greater<ll>>;// 昇順 using Priority_pair = priority_queue<P, vector<P>, greater<P>>; // using mint_17 = modint1000000007; // using mint = modint998244353; #define mod 1000000007 #define MAX_WIDTH 60 #define MAX_HEIGHT 60 #define INF 1e18 #define MOD 998244353 #define PI 3.141592653589793 #define rep(i, s, n) for (ll i=(s);i<(n);i++) #define rrep(i, s, n) for (ll i=(n);i>=(s);i--) #define all(v) (v).begin(), (v).end() #define YES(n) cout << ((n) ? "YES" : "NO") << endl #define Yes(n) cout << ((n) ? "Yes" : "No") << endl #define pb(n) push_back(n) #define vi vector<int> #define vll vector<ll> #define vs vector<string> #define vc vector<char> #define vp vector<pair<ll, ll>> #define mll map<ll, ll> #define msl map<string, ll> #define COUT(n) cout << (n) << endl #define isInGrid(n, h, w) (0 <= (n) && (n) < (h) && 0 <= (n) && (n) < (w)) template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } ll N, A[201010]; int main() { cin >> N; vll B; ll cnt = 0; rep(i, 0, N) { cin >> A[i]; if(A[i] == 0) cnt++; else B.pb(A[i]); } sort(all(B)); ll g = 0; ll n = B.size(), z_cnt = 0; rep(i, 0, n-1) { if(B[i+1]-B[i] == 0) { z_cnt++; } } if(z_cnt != 0) { Yes(z_cnt == n-1); return 0; } rep(i, 0, n-1) { if(i == 0) { g = (B[i+1]-B[i]); } else { g = __gcd(g, B[i+1]-B[i]); } } ll sum = 0; rep(i, 0, n-1) { sum += ((B[i+1]-B[i])/g)-1; } Yes(sum <= cnt); return 0; }