#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const int INF = 1e9 + 7;
const long long LINF = 1e18;
const double PI = 3.1415926535897932384626433832795;
const int MAX_SIZE = 5e5;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
bool IS_ONE_TEST = 1;
long double START_TIME, TIME;
void fast_in_out() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void solve() {
  long long n, s = 0, mx = 0;
  cin >> n;
  vector<long long> a(n);
  for (auto& i : a) {
    cin >> i;
    s += i;
    mx = max(mx, i);
  }
  if (s & 1) {
    cout << "NO" << '\n';
    return;
  }
  if (mx > s / 2) {
    cout << "NO" << '\n';
    return;
  }
  cout << "YES" << '\n';
}
int main() {
  fast_in_out();
  START_TIME = clock();
  int TESTS = 1;
  if (!IS_ONE_TEST) cin >> TESTS;
  while (TESTS--) {
    solve();
  }
  return 0;
}
