CodeForces

You are given an array a1,a2,…,ana1,a2,…,an.

In one operation you can choose two elements aiai and ajaj (i≠ji≠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 nn (2≤n≤1052≤n≤105) — the size of the array.

The second line contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109) — 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

题意：

给你n个数，你可以每次找到两个数并且让它们都减去1.问你可不可以到最后这n个数都变成0

题解：

首先我们可以确定，如果这些数的和是一个奇数的话，那么肯定输出NO。这n个数里面，如果每一次都对这n个数里面的最大值和第二大值进行减1操作。那么减到最后肯定可以全部减为0(前提就是：这n个数里面的最大值肯定要小于其他数之和)

代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    long long n,sum=0,a,maxx=0;
    scanf("%I64d",&n);
    for(long long i=0;i<n;++i)
    {
        scanf("%I64d",&a);
        sum+=a;
        maxx=max(maxx,a);
    }
    if(sum-maxx>=maxx)
    {
        if(sum%2)
            printf("NO
");
        else printf("YES
");
    }
    else printf("NO
");
}