#include <bits/stdc++.h>
using namespace std;
using ll = long long;
long long int mod_pow(long long int a, long long int b, long long int m) {
  long long int res = 1;
  while (b) {
    if (b & 1) {
      res = (res * a) % m;
    }
    a = (a * a) % m;
    b >>= 1;
  }
  return res;
}
long long int mod_inverse(long long int a, long long int m) {
  return mod_pow(a, m - 2, m);
}
void solve() {
  long long int n;
  cin >> n;
  long long int a[n];
  long long int sum = 0;
  for (long long int i = 0; i < n; ++i) {
    cin >> a[i];
    sum += a[i];
  }
  sort(a, a + n);
  if (sum % 2 or sum - a[n - 1] < a[n - 1]) {
    cout << "NO";
    return;
  }
  cout << "YES";
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
