// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include<bits/stdc++.h>
  
using namespace std;
  
#define i64 long long
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()

const int MAXN = 2e5 + 5;
int N;
int a[MAXN];
void Solve(void) {
  cin >> N;
  for (int i = 1; i <= N; i ++) {
    cin >> a[i];
  }
  for (int i = 1; i < N; i ++) {
    for (int j = i + 1; j < N; j ++) {
      for (int z = j + 1; z <= N; z ++) {
        if ((a[i] - a[j]) % a[z] != 0) {
          cout << "no" << "\n";
          return;
        }
        if ((a[i] - a[z]) % a[j] != 0) {
          cout << "no" << "\n";
          return;
        }
        if ((a[z] - a[j]) % a[i] != 0) {
          cout << "no" << "\n";
          return;
        }
      }
    }
  }
  cout << "yes" << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
  cout << fixed << setprecision(10);
  int Tests = 1; // cin >> Tests; 
  for (int i = 1; i <= Tests; i ++) {
    // cout << "Case " << i << ": ";
    Solve();    
  }
}