#include <bits/stdc++.h>
using namespace std;
int main() {
  long long N, cnt = 0, a, ten, tmp;
  cin >> N;
  vector<long long> hat(N);
  for (int i = 0; i < N; i++) {
    cin >> a;
    tmp = 0;
    ten = 0;
    while (a > 1) {
      tmp += pow(10, ten) * (a % 2);
      a = a / 2;
      ten++;
    }
    tmp += pow(10, ten) * (a % 2);
    hat[i] = tmp;
  }
  sort(hat.begin(), hat.end());
  for (int i = 0; i < N - 1; i++) {
    for (int j = i + 1; j < N; j++) {
      long long rakuda = hat[i] + hat[j];
      string raku = to_string(rakuda);
      tmp = 0;
      ten = 0;
      for (int k = raku.size() - 1; k >= 0; k--) {
        if (raku.at(k) == '2') {
          rakuda -= pow(10, ten) * 2;
          raku = to_string(rakuda);
        }
        ten++;
      }
      if (rakuda == hat[N - 1]) {
        cnt++;
        break;
      }
    }
  }
  if (cnt >= 1) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}
