#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const int INF = 2e9 + 7;
const int mod = 1e9 + 7;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
int a[30], b[30], v[30], flag, n, cnt;
bool cmp(int a, int b) { return a > b; }
bool ok(int x) {
  int tot = 0;
  for (int i = 0; i < x; i++) {
    if (v[i] > 0) tot += v[i];
  }
  return tot == cnt;
}
void dfs(int x) {
  if (flag) return;
  if (a[x] == 1 || x == n) {
    if (ok(x)) flag = 1;
    return;
  }
  for (int i = 0; i < x; i++) {
    if (flag) return;
    if (v[i] >= a[x] && a[x] != b[i]) {
      v[i] -= a[x];
      v[x] = b[x] = a[x] - 1;
      dfs(x + 1);
      v[i] += a[x];
      v[x] = -1;
      b[x] = 0;
    }
  }
}
int main() {
  int t, cas = 1, m;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] == 1)
      cnt++;
    else if (a[i] == 2)
      return 0 * puts("NO");
  }
  if (n == 1) return 0 * puts(a[0] == 1 ? "YES" : "NO");
  sort(a, a + n, cmp);
  memset(v, -1, sizeof v);
  if (a[0] != n) return 0 * puts("NO");
  b[0] = a[0] - 1;
  v[0] = a[0] - 1;
  dfs(1);
  if (flag)
    puts("YES");
  else
    puts("NO");
  return 0;
}
