#include using namespace std; using ll = long long; using VI = vector; using P = pair; #define REP(i, n) for (int i = 0; i < (int)(n); i++) #define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++) #define ALL(a) (a).begin(),(a).end() constexpr int INF = 1001001001; constexpr ll LINF = 1001001001001001001ll; constexpr int DX[] = {1, 0, -1, 0}; constexpr int DY[] = {0, 1, 0, -1}; template< typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); } template< typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); } const ll MOD = 998244353; ll gcd(ll x, ll y) { if (y == 0) return x; return gcd(y, x % y); } int main() { ios::sync_with_stdio(false); std::cin.tie(nullptr); int N; cin >> N; vector A(N), B; REP(i, N) { cin >> A[i]; if (A[i] > 0) B.push_back(A[i]); } int M = B.size(), S = 0; //REP(i, M) cout << B[i] << " "; cout << endl; REP(i, M - 1) S += B[i + 1] == B[i]; if (S == M - 1) { cout << "Yes\n"; return 0; } if (S > 0 && M > 2) { cout << "No\n"; return 0; } if (M < 3) { cout << "Yes\n"; return 0; } sort(ALL(B)); ll G = B[1] - B[0]; REP(i, M - 2) G = gcd(G, B[i + 2] - B[0]); //cout << B[M - 1] << " " << B[0] << " " << G << endl; if ((B[M - 1] - B[0]) / G <= N - 1) cout << "Yes\n"; else cout << "No\n"; }