#include <bits/stdc++.h>
using ll = long long;
using namespace std;
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
int main() {
  int n;
  cin >> n;
  int a[100010];
  for (int i = 0; i < (int)(n); i++) cin >> a[i];
  sort(a, a + n);
  int cu = 0;
  int sec = 1;
  bool no = !(a[0] == cu || a[0] == sec);
  int i = 0;
  cout << "Yes" << endl;
  return 0;
  if (no) {
    while (cu <= 1 << 30) {
      if (a[i] == cu + sec) {
        no = false;
        break;
      }
      int tsum = cu + sec;
      cu = sec;
      sec = tsum;
    }
  }
  if (no) {
    cout << "No" << endl;
    return 0;
  }
  int mia = a[0];
  int mim = 0;
  int mxa = a[n - 1];
  int mxm = 0;
  while (mia / 2 > 0) {
    mia /= 2;
    mim++;
  }
  while (mxa / 2 > 0) {
    mxa /= 2;
    mxm++;
  }
  if (mia != mxm) {
    cout << "No" << endl;
    return 0;
  }
  for (int i = 1; i <= (int)(n - 2); i++) {
    if (a[i + 1] != a[i] + a[i - 1]) {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
}
