#include <bits/stdc++.h>
using namespace std;
const int base = 1e9 + 7;
const long long MAX_N = 300001;
int Solves() {
  long long n, m;
  cin >> n;
  long long a[n + 1];
  long long sum = 0;
  long long maxx = 0;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) {
    sum += a[i];
    maxx = max(maxx, a[i]);
  }
  if (n == 2) {
    if (a[1] == a[2])
      cout << "YES";
    else
      cout << "NO";
    return 0;
  }
  if (sum % 2 == 0 && maxx <= sum / 2)
    cout << "YES";
  else
    cout << "NO";
}
int main() { Solves(); }
