#include <bits/stdc++.h>
using namespace std;
int n, p[30], cnt = 0;
bool use[30];
bool dfs(int now, int cur, int son, int need, int leaf) {
  if (leaf < 0) return 0;
  if (now == cnt) return 1;
  if (!need) {
    if (son < 2) return 0;
    return dfs(now + 1, 0, 0, p[now + 1] - 1, leaf);
  }
  int i;
  for (i = cur; i < now && use[i]; ++i)
    ;
  if (p[i] > need) {
    if (son + need < 2) return 0;
    return dfs(now + 1, 0, 0, p[now + 1] - 1, leaf - need);
  }
  use[i] = 1;
  if (dfs(now, i + 1, son + 1, need - p[i], leaf)) return true;
  use[i] = 0;
  return dfs(now, i + 1, son, need, leaf);
}
int main() {
  scanf("%d", &n);
  if (n == 1) {
    puts("YES");
    return 0;
  }
  for (int i = 0; i < n; ++i) {
    int x;
    scanf("%d", &x);
    if (x > 1) p[cnt++] = x;
  }
  int leaf = n - cnt;
  if (leaf * 2 <= n) {
    puts("NO");
    return 0;
  }
  sort(p, p + cnt);
  if (p[cnt - 1] != n) {
    puts("NO");
    return 0;
  }
  puts(dfs(0, 0, 0, p[0] - 1, leaf) ? "YES" : "NO");
  return 0;
}
