#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int c[50];
int cnt[50];
int n;
bool dfs(int k) {
  if (k == 0) {
    for (int i = 1; i <= n; i++) {
      if (cnt[i] != c[i] - 1)
        return false;
      else
        return true;
    }
  }
  for (int i = n; i > k; i--) {
    if (c[i] - c[k] >= 2 && c[k] + cnt[i] < c[i]) {
      cnt[i] += c[k];
      if (dfs(k - 1)) return true;
      cnt[i] -= c[k];
    }
  }
  return false;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &c[i]);
  }
  sort(c + 1, c + 1 + n);
  if (n == 1) {
    if (c[n] == 1)
      printf("YES\n");
    else
      printf("NO\n");
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    if (c[i] == 2) {
      printf("NO\n");
      return 0;
    }
  }
  if (c[n] == n && dfs(n - 1))
    printf("YES\n");
  else
    printf("NO\n");
  return 0;
}
