#include //#define __INCLUDE_ATCODER_LIB //#define __INTERPRETER #ifdef __INCLUDE_ATCODER_LIB #include using namespace atcoder; #endif using namespace std; #define overload4(a, b, c, d, e, ...) e #define rep1(a) for(decltype(a) i = 0, i##_len = (a); i < i##_len; ++i) #define rep2(i, a) for(decltype(a) i = 0, i##_len = (a); i < i##_len; ++i) #define rep3(i, a, b) for(decltype(b) i = (a), i##_len = (b); i < i##_len; ++i) #define rep4(i, a, b, c) for(decltype(b) i = (a), i##_len = (b); i < i##_len; i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep1(a) for(decltype(a) i = (a); i--;) #define rrep2(i, a) for(decltype(a) i = (a); i--;) #define rrep3(i, a, b) for(decltype(a) i = (b), i##_len = (a); i-- > i##_len;) #define rrep4(i, a, b, c) for(decltype(a) i = (a)+((b)-(a)-1)/(c)*(c), i##_len = (a); i >= i##_len; i -= c) #define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define sz(x) ((int)(x).size()) #define yes(s) cout << ((s)?"Yes":"No") << "\n"; #define bit(n) (1LL << ((int)(n))) #define get1bit(x,n) (((x) >> (int)(n)) & 1) #define INF ((1 << 30) - 1) #define INFL (1LL << 60) #define PRECISION std::setprecision(16) #ifdef __INTERPRETER #define NO_SYNC_STD #define ENDL std::endl #else #define NO_SYNC_STD std::cin.tie(nullptr);ios::sync_with_stdio(false) #define ENDL "\n" #endif #ifdef __LOCAL #include #define dump(...) DUMPOUT << " " << string(#__VA_ARGS__) << ": " << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl << " ", dump_func(__VA_ARGS__) #else #define dump(...) #endif using ll=long long;using ld=long double;template using V=vector;template using VV=vector>;template using PQ=priority_queue,greater>; template istream &operator>>(istream &is,complex &v){T x,y; is >> x >> y;v.real(x);v.imag(y);return is;} template istream &operator>>(istream &is,V &v){for(auto&& e:v)is >> e;return is;} template istream &operator>>(istream &is,pair &v){is >> v.first >> v.second;return is;} template istream &operator>>(istream &is,array &v){for(auto&& e:v)is >> e;return is;} template void print_rest(){cout << ENDL;} template void print_rest(const T& first,const A&... rest){cout << " " << first;print_rest(rest...);} template void print(const T& first,const A&... rest){cout << fixed << PRECISION << first;print_rest(rest...);} template void printx(const T& first,const A&... rest){cout << fixed << PRECISION << first;print_rest(rest...);exit(0);} template inline string join(const T& v,string sep=" "){if(v.size() == 0)return "";stringstream ss;for(auto&& e:v)ss << sep << e;return ss.str().substr(sz(sep));} template inline string padding(const T& v,int length,char pad=' ',bool left=false){stringstream ss;ss << (left?std::left:std::right) << setw(length) << setfill(pad) << v;return ss.str();} template V make_vec(size_t n,T a){return V(n,a);} template auto make_vec(size_t n,Ts... ts){return V(n,make_vec(ts...));} template inline bool chmax(T& a,T b){if(a inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;} template inline int lower_index(V&a,T x){return distance(a.begin(),lower_bound(all(a),x));} template inline int upper_index(V&a,T x){return distance(a.begin(),upper_bound(all(a),x));} template pair binarysearch(T ng,T ok,T eps,F f,bool sign=false){while(abs(ng-ok)>eps){auto mid=ng+(ok-ng)/2;if(sign^f(mid)){ok=mid;}else{ng=mid;}}return{ng,ok};} template constexpr T cdiv(T x,T y){return (x+y-1)/y;} template constexpr bool between(T a,T x,T b){return(a<=x&&x constexpr T pos1d(T y,T x,T h,T w){assert(between(T(0),y,h));assert(between(T(0),x,w));return y*w+x;} template constexpr pair pos2d(T p,T h,T w){T y=p/w,x=p-y*w;assert(between(T(0),y,h));assert(between(T(0),x,w));return{y,x};} constexpr ll modpow(ll x,ll n,ll m=1152921504606846976LL){ll ret=1;for(;n>0;x=(__int128)x*x%m,n>>=1)if(n&1)ret=(__int128)ret*x%m;return ret;} constexpr ll keta(ll n, ll base = 10LL) {ll ret = 0; while(n > 0) {n /= base, ret++;} return ret;} constexpr int pcnt(ll x) {return __builtin_popcountll(x);} constexpr int flog(ll x) {return 63 - __builtin_clzll(x);} constexpr int clog(ll x) {return (x==1LL)?0:(64-__builtin_clzll(x-1LL));} struct Solver { void solve() { int n; cin >> n; V a(n); cin >> a; sort(all(a)); int emptyCnt = 0; V dif(n); rep(i,n-1) { emptyCnt += (a[i] == 0); if (a[i] != 0) dif[i] = a[i+1] - a[i]; } int g = dif[emptyCnt]; dump(g, emptyCnt, a); rep(i,emptyCnt+1,n) g = gcd(g,dif[i]); int requireCnt = 0; rep(i,n) if (dif[i] > g) requireCnt += (dif[i] / g) - 1; yes(requireCnt <= emptyCnt); dump(requireCnt,emptyCnt,dif,g); } } solver; signed main(void){NO_SYNC_STD;dump("");solver.solve();return 0;}