#include <bits/stdc++.h>
using namespace std;
const int maxn = 30;
int n, c[maxn];
bool mark[maxn], flag1, flag2;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> c[i];
  sort(c, c + n);
  for (int i = 0; i < n; i++) {
    int sum = 1;
    for (int j = 0; j < i && sum < c[i]; j++)
      if (c[j] < c[i] - 1 && sum + c[j] <= c[i] && !mark[j])
        mark[j]++, sum += c[j];
    if (sum != c[i]) flag1++;
  }
  for (int i = 0; i < n - 1; i++)
    if (!mark[i]) flag1++;
  memset(mark, 0, sizeof mark);
  for (int i = 0; i < n; i++) {
    int sum = 1;
    for (int j = i - 1; j >= 0 && sum < c[i]; j--)
      if (c[j] < c[i] - 1 && sum + c[j] <= c[i] && !mark[j])
        mark[j]++, sum += c[j];
    if (sum != c[i]) flag2++;
  }
  for (int i = 0; i < n - 1; i++)
    if (!mark[i]) flag2++;
  if (flag1 && flag2)
    cout << "NO";
  else
    cout << "YES";
  cerr << endl;
}
