#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
  int n;
  cin >> n;
  long long ar[n];
  for (int i = 0; i < (int)n; i++) cin >> ar[i];
  ;
  long long sum = 0;
  for (long long i = 0; i < (int)n; ++i) sum += ar[i];
  if (sum % 2 == 1)
    puts("NO");
  else {
    long long mx = 0;
    for (long long i = 0; i < (int)n; ++i) mx = max(mx, ar[i]);
    if (mx * 2 <= sum)
      puts("YES");
    else
      puts("NO");
  }
}
