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