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;
const double pi = acos(-1.0);
template <typename T>
T Abs(T a) {
  if (a < 0)
    return -a;
  else
    return a;
}
template <typename T>
T BigMod(T b, T p, T m) {
  if (p == 0) return 1;
  if (p % 2 == 0) {
    T s = BigMod(b, p / 2, m);
    return ((s % m) * (s % m)) % m;
  }
  return ((b % m) * (BigMod(b, p - 1, m) % m)) % m;
}
template <typename T>
T Pow(T B, T P) {
  if (P == 0) return 1;
  if (P & 1)
    return B * Pow(B, P - 1);
  else
    return (Pow(B, P / 2) * Pow(B, P / 2));
}
template <typename T>
T gcd(T a, T b) {
  if (a < 0) return gcd(-a, b);
  if (b < 0) return gcd(a, -b);
  return (b == 0) ? a : gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
  if (a < 0) return lcm(-a, b);
  if (b < 0) return lcm(a, -b);
  return a * (b / gcd(a, b));
}
template <typename T>
T exgcd(T a, T b, T &x, T &y) {
  if (a < 0) {
    T d = exgcd(-a, b, x, y);
    x = -x;
    return d;
  }
  if (b < 0) {
    T d = exgcd(a, -b, x, y);
    y = -y;
    return d;
  }
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  } else {
    T d = exgcd(b, a % b, x, y);
    T t = x;
    x = y;
    y = t - (a / b) * y;
    return d;
  }
}
template <typename T>
typename std::vector<T>::iterator insert_sorted(std ::vector<T> &vec,
                                                T const &item) {
  return vec.insert(std::upper_bound(vec.begin(), vec.end(), item), item);
}
template <typename T>
T isperfectsq(T x) {
  T n = sqrt(x);
  return ((n * n == x) ? 1 : 0);
}
char uplowch(char ch) {
  if (ch >= 'A' && ch <= 'Z') ch += 32;
  return ch;
}
char lowupch(char ch) {
  if (ch >= 'a' && ch <= 'z') ch -= 32;
  return ch;
}
bool isalpha(char ch) {
  if ((ch >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z')) return true;
  return false;
}
int strtoint(string str) {
  stringstream ss(str);
  int x = 0;
  ss >> x;
  return x;
}
string intostr(int x) {
  stringstream ss;
  ss << x;
  string str = ss.str();
  return str;
}
vector<string> linetostr(string str) {
  string s;
  vector<string> v;
  istringstream is(str);
  while (is >> s) v.push_back(s);
  return v;
}
int main() {
  int n;
  cin >> n;
  long long arr[n + 5];
  long long tot = 0;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    tot += arr[i];
  }
  sort(arr, arr + n);
  long long sum = tot - arr[n - 1];
  if (tot % 2 == 0 && sum >= arr[n - 1])
    cout << "YES\n";
  else
    cout << "NO\n";
  return 0;
}
