#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
int main() {
  bool p = true;
  ll n;
  cin >> n;
  ll a[110000];
  for (ll i = ll(0); i < ll(n); i++) cin >> a[i];
  ll ans = 0;
  sort(a, a + n);
  for (ll i = ll(0); i < ll(n - 2); i++) {
    if (a[i] + a[i + 1] != a[i + 2]) {
      p = false;
      break;
    }
  }
  if (p)
    cout << "Yes";
  else
    cout << "No";
}
