#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double pi = 3.14159265354;
int t, n, m, k, cnt;
int a[maxn];
bool vis[maxn];
int main() {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(0);
  cin >> n;
  int sum = 0;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    sum += a[i];
  }
  sort(a + 1, a + 1 + n);
  if (sum == n * 3) {
    cout << "YES" << endl;
    return 0;
  }
  vis[n] = 1;
  for (int i = 1; i <= n; ++i) {
    int cnt = 1;
    for (int j = i - 1; j >= 1 && a[i] > cnt; --j) {
      if (!vis[j]) {
        if (a[j] + 2 <= a[i] && cnt + a[j] <= a[i]) {
          cnt += a[j];
          vis[j] = 1;
        }
      }
    }
    if (a[i] != cnt) {
      cout << "NO" << endl;
      return 0;
    }
  }
  for (int i = 1; i <= n; ++i) {
    if (!vis[i]) {
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;
  return 0;
}
