#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
long long inv(long long x) { return x <= 1 ? 1 : inv(P % x) * (P - P / x) % P; }
const int N = 2e5 + 10;
int a[N], b[N], f[N], n, m, k;
bool dfs(int cur, int sum, int cnt) {
  if (cur > n) return 1;
  if (sum + 1 == a[cur]) {
    return cnt != 1 && dfs(cur + 1, 0, 0);
  }
  int lst = -1;
  for (int i = 1; i <= n; ++i) {
    if (!f[i] && a[i] != lst && sum + a[i] < a[cur]) {
      f[i] = 1, lst = a[i];
      if (dfs(cur, sum + a[i], cnt + 1)) return 1;
      f[i] = 0;
    }
  }
  return 0;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", a + i);
  sort(a + 1, a + 1 + n);
  puts(a[n] == n && dfs(1, 0, 0) ? "YES" : "NO");
}
