#include <bits/stdc++.h>
using namespace std;
int n;
int a[233];
int ta[233];
int sons[233];
bool dfs(int one, int i) {
  if (i == n) {
    if (a[i] - 1 - one == 0)
      return 1;
    else
      return 0;
  }
  one -= a[i] - 1;
  if (one < 0) return 0;
  int s = sons[i];
  s += a[i] - 1;
  if (s < 2) return 0;
  for (int j = i + 1; j <= n; j++)
    if (a[j] > ta[i]) {
      a[j] -= ta[i];
      sons[j]++;
      if (dfs(one, i + 1)) return 1;
      sons[j]--;
      a[j] += ta[i];
    }
  return 0;
}
int main() {
  scanf("%d", &n);
  int one = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    one += a[i] == 1;
  }
  sort(a + 1, a + 1 + n);
  for (int i = 1; i <= n; i++) ta[i] = a[i];
  if (one <= n / 2) {
    puts("NO");
    return 0;
  }
  if (n == 1) {
    if (a[1] == 1)
      puts("YES");
    else
      puts("NO");
    return 0;
  }
  if (n == 2) {
    puts("NO");
    return 0;
  }
  if (dfs(one, one + 1)) {
    puts("YES");
  } else {
    puts("NO");
  }
  return 0;
}
