#include <bits/stdc++.h>
using namespace std;
const long long int N = 300009;
const long long int mod = 1000000007;
void pre() {}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin.exceptions(cin.failbit);
  ;
  pre();
  long long int n, sum = 0;
  cin >> n;
  vector<long long int> a(n);
  for (long long int i = 0; i < (n); ++i) {
    cin >> a[i];
    sum += a[i];
  }
  if (sum % 2) {
    cout << "NO\n";
    return 0;
  }
  sort(a.begin(), a.end());
  if (a[n - 1] > (sum / 2)) {
    cout << "NO\n";
    return 0;
  }
  cout << "YES\n";
  return 0;
}
