#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
void solve() {
  int N;
  cin >> N;
  vector<long long int> arr(N);
  for (int i = 0; i < N; i++) cin >> arr[i];
  long long int sum = 0;
  long long int maxi = -1;
  for (int i = 0; i < N; i++) {
    sum += arr[i];
    maxi = max(maxi, arr[i]);
  }
  if (sum % 2 != 0 or sum < 2 * maxi) {
    cout << "NO" << endl;
    return;
  }
  cout << "YES" << endl;
}
int main() {
  solve();
  return 0;
}
