#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
using namespace std;
vector<long long> vec;
long long t;
long long cnt[10000][5];
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, m;
  cin >> n;
  vec.resize(n);
  for (int i = 0; i < n; i++) cin >> vec[i];
  long long ch = 0, nech = 0, sum = 0, maxn = 0;
  for (int i = 0; i < n; i++) {
    if (vec[i] % 2 == 0)
      ch++;
    else
      nech++;
    sum += vec[i];
    maxn = max(maxn, vec[i]);
  }
  if (sum % 2 == 0 && maxn <= sum - maxn) {
    cout << "YES";
  } else {
    cout << "NO";
  }
  return 0;
}
