#include <bits/stdc++.h>
using namespace std;
const int MAX = 30;
int a[MAX], be[MAX], n;
bool f1 = 1, f2 = 1;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  for (int i = 0; i < n; i++) {
    int sz = 1;
    for (int j = 0; j < i && sz < a[i]; j++)
      if (a[j] <= a[i] - 2 && sz + a[j] <= a[i] && !be[j])
        be[j] = 1, sz += a[j];
    if (sz != a[i]) f1 = 0;
  }
  for (int i = 0; i < n; i++)
    if (i != n - 1 && !be[i]) f1 = 0;
  memset(be, 0, sizeof be);
  for (int i = 0; i < n; i++) {
    int sz = 1;
    for (int j = i - 1; j >= 0 && sz < a[i]; j--)
      if (a[j] <= a[i] - 2 && sz + a[j] <= a[i] && !be[j])
        be[j] = 1, sz += a[j];
    if (sz != a[i]) f2 = 0;
  }
  for (int i = 0; i < n; i++)
    if (i != n - 1 && !be[i]) f2 = 0;
  if (f1 || f2)
    cout << "YES";
  else
    cout << "NO";
}
