#include <bits/stdc++.h>
using namespace std;
int cnt[200007][26];
bool isPrime(long long n) {
  for (long long i = 2; i <= sqrt(n); i++)
    if (n % i == 0) return false;
  return true;
}
int main() {
  int t;
  t = 1;
  while (t--) {
    int n;
    cin >> n;
    int arr[n];
    int m = -1;
    for (int i = 0; i < n; i++) {
      cin >> arr[i];
      m = max(m, arr[i]);
    }
    long long x = 0;
    for (int i = 0; i < n; i++) x += arr[i];
    if (x % 2 != 0)
      cout << "NO";
    else {
      if (x - m < m)
        cout << "NO";
      else
        cout << "YES";
    }
  }
}
