#include <bits/stdc++.h>
using namespace std;
int f1[10001], f2[10001], pre[10001], num[10001], n, sum;
int a[10001], use[10001];
int main() {
  scanf("%d", &n);
  if (n == 1) {
    puts("YES");
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    if (a[i] > sum) sum = a[i];
    if (a[i] == 2) {
      puts("NO");
      return 0;
    }
  }
  if (sum != n) {
    puts("NO");
    return 0;
  }
  sort(a + 1, a + 1 + n);
  for (int i = 1; i <= n; i++) {
    if (a[i] == 1) continue;
    for (int j = 0; j <= a[i]; j++) f1[j] = f2[j] = pre[j] = 0;
    for (int j = 1; j < i; j++) {
      if (use[j]) continue;
      for (int k = a[i] - a[j]; k >= 0; k--) {
        if (f1[k]) f2[k + a[j]] = 1, pre[k + a[j]] = j;
        if (f2[k])
          if (!f2[k + a[j]]) f2[k + a[j]] = 1, pre[k + a[j]] = j;
      }
      f1[a[j]] = 1;
      num[a[j]] = j;
    }
    if (!f2[a[i] - 1]) {
      puts("NO");
      return 0;
    }
    int tmp;
    for (tmp = a[i] - 1; pre[tmp]; tmp = tmp - a[pre[tmp]]) use[pre[tmp]] = 1;
    use[num[tmp]] = 1;
  }
  puts("YES");
}
