/** * author: shu8Cream * created: 25.03.2022 21:18:53 **/ #include using namespace std; #define overload3(a,b,c,d,...) d #define rep1(i,n) for (int i=0; i<(n); i++) #define rep2(i,a,n) for (int i=(a); i<(n); i++) #define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__) #define rrep1(i,n) for (int i=(n-1); i>=0; i--) #define rrep2(i,a,n) for (int i=(n-1); i>=(a); i--) #define rrep(...) overload3(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define sz(x) int((x).size()) using ll = long long; using P = pair; template using vc = vector; template using vv = vc>; using vi = vc; using vvi = vv; const ll INF = 8e18; templateistream& operator>>(istream&i,vc&v){rep(j,sz(v))i>>v[j];return i;} templatestring join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<ostream& operator<<(ostream&o,const vc&v){if(sz(v))o<istream& operator>>(istream&i,pair&v){return i>>v.first>>v.second;} templateostream& operator<<(ostream&o,const pair&v){return o< inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template string to_string(T s); template string to_string(pair p); string to_string(char c) { return string(1, c); } string to_string(string s) { return s; } string to_string(const char s[]) { return string(s); } template string to_string(T v) { if (v.empty()) return "{}"; string ret = "{"; for (auto x : v) ret += to_string(x) + ","; ret.back() = '}'; return ret; } template string to_string(pair p) { return "{" + to_string(p.first) + ":" + to_string(p.second) + "}"; } void debug_out() { cout << endl; } template void debug_out(Head H, Tail... T) { cout << to_string(H) << " "; debug_out(T...); } #ifdef _DEBUG #define debug(...) debug_out(__VA_ARGS__) #else #define debug(...) #endif vi divisor(ll n) { vi ret; for (ll i = 1; i * i <= n; i++) { if (n % i == 0) { ret.push_back(i); if (i * i != n) ret.push_back(n / i); } } sort(rall(ret)); // 昇順に並べる return ret; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll n; cin >> n; vi a(n); cin >> a; int cnt = 0; rep(i,n)if(a[i]==0) cnt++; sort(all(a)); if(cnt>=n-1){ cout << "Yes" << endl; return 0; } vi d(n-cnt-1); rep(i,cnt,n-1) d[i-cnt] = a[i+1]-a[i]; rep(i,sz(d))if(d[i]==0){ int c = 0; rep(i,cnt,n)if(a[cnt]==a[i]) c++; cout << (c==n-cnt ? "Yes" : "No") << endl; return 0; } ll g = 0; rep(i,sz(d)) g = gcd(g,d[i]); vi div = divisor(g); bool f = false; for(auto p : div){ ll tmp = 0; rep(i,sz(d)){ tmp += d[i]/p-1; } if(tmp<=cnt){ f = true; break; } } cout << (f ? "Yes" : "No") << endl; }