#include using namespace std; using i64 = long long; #define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++) #define all(x) x.begin(),x.end() #define STRINGIFY(n) #n #define TOSTRING(n) STRINGIFY(n) #define PREFIX "#" TOSTRING(__LINE__) "| " #define debug(x) \ { \ std::cout << PREFIX << #x << " = " << x << std::endl; \ } std::ostream& output_indent(std::ostream& os, int ind) { for(int i = 0; i < ind; i++) os << " "; return os; } template std::ostream& operator<<(std::ostream& os, const std::pair& p); template std::ostream& operator<<(std::ostream& os, const std::vector& v); template std::ostream& operator<<(std::ostream& os, const std::pair& p) { return (os << "(" << p.first << ", " << p.second << ")"); } template std::ostream& operator<<(std::ostream& os, const std::vector& v) { os << "["; for(int i = 0;i < v.size();i++) os << v[i] << ", "; return (os << "]"); } template static inline std::vector ndvec(size_t&& n, T val) { return std::vector(n, std::forward(val)); } template static inline auto ndvec(size_t&& n, Tail&&... tail) { return std::vector(tail)...))>(n, ndvec(std::forward(tail)...)); } i64 gcd(i64 a, i64 b) { if(b == 0) return a; return gcd(b, a % b); } int main() { i64 N; cin >> N; vector A; i64 cnt = 0; rep(i,0,N) { i64 a; cin >> a; if(a > 0) { A.push_back(a); } else { cnt++; } } if(A.size() <= 1) { cout << "Yes" << endl; return 0; } sort(all(A)); i64 G = A[1] - A[0]; i64 zerod = 0; rep(i,1,A.size()) { G = gcd(G, A[i] - A[i - 1]); if(A[i] - A[i - 1] == 0){ zerod = 1; } } i64 sum = 0; if(zerod) { if(A.front() == A.back()) { cout << "Yes" << endl; } else { cout << "No" << endl; } return 0; } rep(i,1,A.size()) { i64 a = A[i]; i64 b = A[i - 1]; i64 c = (a - b) / G - 1; sum += c; } if(sum <= cnt) { cout << "Yes" << endl; } else { cout << "No" << endl; } }