#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1 + 1e5;
long long n, a[MAXN], sum;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = (0), _b = (n); i < _b; ++i) {
    cin >> a[i];
    sum += a[i];
  }
  if (sum % 2 == 1) {
    cout << "NO";
    return 0;
  } else {
    sort(a, a + n);
    long long k = sum / 2;
    if (a[n - 1] <= k)
      cout << "YES";
    else
      cout << "NO";
    return 0;
  }
  return 0;
}
