#include <bits/stdc++.h>
using namespace std;
const int maxn = 30;
int nums[maxn];
int c[maxn];
int table[maxn][maxn * maxn];
int n;
bool cmp(const int& a, const int& b) { return a > b; }
bool dfs(int st, int i) {
  if (i == n) {
    for (int j = 0; j < n; ++j)
      if (nums[j]) return false;
    return true;
  }
  int begin = st;
  if (nums[i] != nums[i - 1]) begin = 0;
  for (int j = begin; j < i; ++j)
    if (nums[j] >= c[i] && c[i] < c[j] - 1 &&
        ((i + 1 >= n) || table[i + 1][nums[j] - c[i]])) {
      nums[j] -= c[i];
      if (dfs(j, i + 1)) return true;
      nums[j] += c[i];
    }
  return false;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d", c + i);
  sort(c, c + n, cmp);
  memset(table, 0, sizeof(table));
  table[n - 1][0] = 1;
  table[n - 1][c[n - 1]] = 1;
  for (int i = n - 2; i >= 0; --i)
    for (int j = 0; j < maxn * maxn; ++j) {
      if (j + c[i] < maxn * maxn) table[i][j + c[i]] += table[i + 1][j];
      table[i][j] += table[i + 1][j];
    }
  for (int i = 0; i < n; ++i) nums[i] = c[i] - 1;
  if ((n == 1 || table[1][nums[0]]) && dfs(1, 1))
    puts("YES");
  else
    puts("NO");
  return 0;
}
