#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  vector<long long> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<long long> B;
  for (int i = 0; i < N; i++){
    if (A[i] != 0){
      B.push_back(A[i]);
    }
  }
  if (B.size() <= 1){
    cout << "Yes" << endl;
  } else if (B == vector<long long>(B.size(), B[0])){
    cout << "Yes" << endl;
  } else {
    int M = B.size();
    long long g = 0;
    for (int i = 0; i < M - 1; i++){
      g = gcd(g, B[i + 1] - B[i]);
    }
    if (g == 0){
      cout << "No" << endl;
    } else {
      long long cnt = (B[M - 1] - B[0]) / g + 1;
      if (cnt <= N){
        cout << "Yes" << endl;
      } else {
        cout << "No" << endl;
      }
    }
  }
}