You are given an array a_1, a_2, …, a_n.

In one operation you can choose two elements a_i and a_j (i ≠ j) and decrease each of them by one.

You need to check whether it is possible to make all the elements equal to zero or not.

Input

The first line contains a single integer n (2 ≤ n ≤ 10^5) — the size of the array.

The second line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — the elements of the array.

Output

Print "YES" if it is possible to make all elements zero, otherwise print "NO".

Examples

Input


4
1 1 2 2


Output


YES

Input


6
1 2 3 4 5 6


Output


NO

Note

In the first example, you can make all elements equal to zero in 3 operations: 

  * Decrease a_1 and a_2, 
  * Decrease a_3 and a_4, 
  * Decrease a_3 and a_4 



In the second example, one can show that it is impossible to make all elements equal to zero.
#include <bits/stdc++.h>
using namespace std;
long long int mod;
void prime(long long int a, vector<long long int> &v) {
  for (long long int i = 2ll; i * i <= a; i++) {
    if (a % i == 0ll) v.push_back(i);
    while (a % i == 0ll) {
      a = a / i;
    }
  }
  if (a > 1ll) v.push_back(a);
}
bool isprime(long long int a) {
  for (long long int i = 2; i * i <= a; i++)
    if (a % i == 0) return false;
  return true;
}
long long int expmod(long long int a, long long int b) {
  if (b == 1) return a;
  if (b == 0) return 1;
  long long int m1 = expmod(a, b / 2) % mod;
  if (b % 2) return ((m1 * m1) % mod * a % mod) % mod;
  return (m1 * m1) % mod;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
struct myComp {
  constexpr bool operator()(pair<int, pair<int, int>> const &a,
                            pair<int, pair<int, int>> const &b) const noexcept {
    if (a.first < b.first) return true;
    if (a.first > b.first) return false;
    return a.second.first > b.second.first;
  }
};
class compare {
 public:
  bool operator()(pair<int, long long int> &p, pair<int, long long int> &q) {
    return p.second >= q.second;
  }
};
long long int bs1(long long int a[], long long int n, long long int x) {
  long long int anss = -1;
  long long int l = 0;
  long long int h = n - 1;
  while (l <= h) {
    long long int mid = l + (h - l) / 2;
    if (a[mid] <= x) {
      anss = mid;
      l = mid + 1;
    } else
      h = mid - 1;
  }
  return anss;
}
long long int bs2(long long int a[], long long int n, long long int x) {
  long long int anss = -1;
  long long int l = 0;
  long long int h = n - 1;
  while (l <= h) {
    long long int mid = l + (h - l) / 2;
    if (a[mid] >= x) {
      anss = mid;
      h = mid - 1;
    } else
      l = mid + 1;
  }
  return anss;
}
bool seen[80001];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int test;
  test = 1;
  while (test--) {
    int n;
    cin >> n;
    long long int a[n];
    long long int sum = 0;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      sum += a[i];
    }
    sort(a, a + n);
    if (sum % 2 == 0) {
      if (sum - a[n - 1] >= a[n - 1])
        cout << "YES";
      else
        cout << "NO";
    } else
      cout << "NO";
    cout << "\n";
  }
}
