#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
int a[26], sum[26];
int n;
int dfs(int p) {
  int i, j, tem;
  if (a[p] == 1) return 1;
  for (i = n; i > p; i--)
    if (sum[i] + a[p] < a[i] && a[p] < a[i] - 1) {
      sum[i] += a[p];
      if (dfs(p - 1)) return 1;
      sum[i] -= a[p];
    }
  return 0;
}
int cau() {
  int i, j, tem;
  int num1 = 0;
  sort(a + 1, a + 1 + n);
  for (i = 1; i <= n; i++) {
    if (a[i] == 1) num1++;
    if (a[i] == 2) return 0;
  }
  if (n - num1 + 1 > num1) return 0;
  if (a[n] != n) return 0;
  memset(sum, 0, sizeof(sum));
  if (n == 1) return 1;
  return dfs(n - 1);
}
int main() {
  int i, j, tem;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d", &a[i]);
  int ans = cau();
  if (ans)
    printf("YES\n");
  else
    printf("NO\n");
  return 0;
}
