#include <bits/stdc++.h>
using namespace std;
int n;
int nodes[24];
int vis[24];
int dodo(int x, int cur, int child) {
  if (x == n) return 1;
  if (nodes[x] - cur == 1)
    if (child == 1)
      return 0;
    else
      return dodo(x + 1, 0, 0);
  int pre = -1;
  for (int i = 0; i < n; i++)
    if (nodes[i] != pre)
      if (!vis[i] && nodes[x] >= nodes[i] + cur) {
        pre = nodes[i];
        vis[i] = 1;
        if (dodo(x, cur + nodes[i], child + 1)) return 1;
        vis[i] = 0;
      }
  return 0;
}
int main(void) {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", nodes + i);
  sort(nodes, nodes + n);
  if (nodes[n - 1] != n)
    printf("NO\n");
  else
    dodo(0, 0, 0) ? printf("YES\n") : printf("NO\n");
}
