#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ii = pair<int, int>;
using iii = pair<int, ii>;
using vi = vector<int>;
using vii = vector<ii>;
using vvi = vector<vi>;
using vs = vector<string>;
const int INF = INT_MAX - 5;
const ll LINF = LLONG_MAX - 5;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;
int n;
int v[N];
int main() {
  cin >> n;
  ll sm = 0;
  for (ll i = (ll)(0); i < (ll)(n); ++i) {
    cin >> v[i];
    sm += v[i];
  }
  sort(v, v + n);
  ll acm = 0;
  bool ok = false;
  for (ll i = (ll)(0); i < (ll)(n - 1); ++i) {
    acm += v[i];
    if (acm >= (sm - acm)) {
      int dif = sm - acm;
      if ((acm - dif) % 2 == 0) {
        ok = true;
        break;
      }
    }
  }
  puts(ok ? "YES" : "NO");
  return 0;
}
