#include <bits/stdc++.h>
using namespace std;
const int N = 1 << 12;
bool dp[12][14][N][25][3], vis[24];
int a[24], n;
bool bf(int p, int sum, int c) {
  if (p == n) return 1;
  if (sum + 1 == a[p]) {
    if (c != 1) return bf(p + 1, 0, 0);
    return 0;
  }
  int i, x, prev = -1;
  if (sum >= a[p]) return 0;
  for (i = 0; i < p; ++i) {
    x = a[i];
    if (!vis[i] && prev != x) {
      vis[i] = 1;
      if (bf(p, sum + x, c + 1)) return 1;
      vis[i] = 0;
      prev = x;
    }
  }
  return 0;
}
int main() {
  int i;
  cin >> n;
  for (i = 0; i < n; ++i) cin >> a[i];
  sort(a, a + n);
  if (bf(0, 0, 0) && a[n - 1] == n) {
    printf("YES\n");
  } else
    printf("NO\n");
}
