#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-10;
vector<long long> primes;
void GeneratingPrimes(int top) {
  vector<bool> p(top + 1, 1);
  p[0] = p[1] = 0;
  for (int i = 2; i <= sqrt(top); i++) {
    if (p[i]) {
      for (int j = i * i; j <= top; j += i) {
        p[j] = 0;
      }
    }
  }
  for (int i = 0; i < top + 1; i++)
    if (p[i]) primes.push_back(i);
}
int gcd(int a, int b) { return (b == 0) ? a : gcd(b, a % b); }
long long POW(long long x, long long p) {
  long long ret = 1;
  while (p) {
    if (p & 1) ret *= x;
    x *= x;
    p /= 2;
  }
  return ret;
}
double dist(int a, int b, int x, int y) {
  return sqrt(pow(a - x, 2) + pow(b - y, 2));
}
int main() {
  int n;
  cin >> n;
  vector<int> v(n);
  long long s = 0;
  for (int i = 0; i < n; i++) {
    cin >> v[i];
    s += v[i];
  }
  if (s & 1) s = 0;
  s /= 2;
  sort(v.begin(), v.end());
  if (s >= v.back())
    cout << "YES";
  else
    cout << "NO";
  return 0;
}
