#include <bits/stdc++.h>
using namespace std;
std::mt19937 rng(
    (int)std::chrono::steady_clock::now().time_since_epoch().count());
const double EPS = 1e-9;
const double PI = acos(-1);
const int MOD = 1000000007;
const int MAXN = 100010;
int v[MAXN];
long long sumL[MAXN];
long long sumR[MAXN];
int n;
int main() {
  if (!false) {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
  }
  cin >> n;
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    cin >> v[i];
    sum += v[i];
  }
  if (sum % 2 != 0) {
    cout << "NO" << '\n';
    return 0;
  }
  for (int i = 0; i < n; i++) {
    if (v[i] > (sum / 2LL)) {
      cout << "NO" << '\n';
      return 0;
    }
  }
  cout << "YES" << '\n';
  return 0;
}
