#include <bits/stdc++.h>
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
using namespace std;
vector<int> V2, V3;
long long int set1[100010];
bool isSubsetSum(int n, long long int sum) {
  if (sum == 0) return true;
  if (n == 0 && sum != 0) return false;
  if (set1[n - 1] > sum) return isSubsetSum(n - 1, sum);
  return isSubsetSum(n - 1, sum) || isSubsetSum(n - 1, sum - set1[n - 1]);
}
int main() {
  int tcase = 1;
  for (int test = 1; test <= tcase; test++) {
    long long int n, n2, ck = 0;
    long long int sum1 = 0, sum2 = 0, sum = 0;
    scanf("%lld", &n);
    for (int i = 0; i < n; i++) {
      long long int a;
      scanf("%lld", &a);
      set1[i] = a;
      sum += a;
    }
    if (sum % 2 != 0) {
      printf("NO\n");
      return 0;
    }
    sum /= 2;
    sort(set1, set1 + n);
    if (set1[n - 1] <= sum) {
      printf("YES\n");
    } else
      printf("NO\n");
  }
}
