#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> v;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    v.push_back(x);
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < n; i++) {
    if (v[i] == 1) continue;
    if (v[i] == 2) {
      puts("NO");
      return 0;
    }
    int req = v[i] - 1, num = 0;
    for (int j = i - 1; j >= 0; j--)
      if (v[j] < req or (v[j] == req and num > 0)) {
        req -= v[j];
        v.erase(v.begin() + j);
        j++;
        i--;
        n--;
        num++;
      }
    if (req != 0) {
      puts("NO");
      return 0;
    }
  }
  puts((int)v.size() == 1 ? "YES" : "NO");
  return 0;
}
