#include <bits/stdc++.h>
using namespace std;
const int MAXN = 24;
const int HALF = 13;
int n, half, ones;
int arr[MAXN + 5];
int best[MAXN + 2][1 << HALF | 2][HALF + 5][2];
int maxVal[1 << HALF | 2], nodes[1 << HALF | 2];
int solve(int rem, int mask, int ones, bool first = false) {
  if (rem < 0) return 0;
  if (ones < 0) return 0;
  int& ret = best[rem][mask][ones][first];
  if (~ret) return ret;
  int i;
  for (i = 0; i < half; i++) {
    if ((mask & (1 << i)) && arr[i] + 1 == rem + 1) {
      if (first) return ret = 0;
      return ret = solve(rem - 1, mask - (1 << i), ones, true);
    }
  }
  if (mask == 0) {
    if (first) return ret = ones == rem && rem > 1;
    return ret = ones == rem;
  }
  ret = 0;
  for (int sub = mask; sub > 0; sub = sub - 1 & mask) {
    if (first && maxVal[sub] == rem) continue;
    ret |= solve(maxVal[sub], sub, maxVal[sub] - nodes[sub], false) &
           solve(rem - maxVal[sub], mask - sub,
                 ones - (maxVal[sub] - nodes[sub]), false);
  }
  return ret;
}
int main() {
  int c, c2;
  scanf("%d", &n);
  for (c = 0; c < n; c++) {
    scanf("%d", &arr[c]);
  }
  sort(arr, arr + n);
  for (ones = 0; ones < n && arr[ones] == 1; ones++)
    ;
  if (arr[n - 1] != n) {
    printf("NO\n");
    return 0;
  }
  reverse(arr, arr + n);
  half = n - ones;
  if (half > HALF) {
    printf("NO\n");
    return 0;
  }
  for (int mask = 0; mask < 1 << half; mask++) {
    maxVal[mask] = 0;
    for (int i = 0; i < half; i++) {
      if (mask & 1 << i) maxVal[mask] = max(maxVal[mask], arr[i]);
    }
    nodes[mask] = __builtin_popcount(mask);
  }
  memset(best, -1, sizeof(best));
  if (solve(n, (1 << half) - 1, ones))
    printf("YES\n");
  else
    printf("NO\n");
  return 0;
}
