Zero Array

题意翻译

给定一个数列$n(2 \le n \le10^5)$，你可以对数列进行任意次操作。操作定义为： * 在数列中选择两个数$a_{i}$，$a_{j}$$(i \ne j, 1 \le a_{i},a_{j} \le 10^9)$，将它们的值分别减$1$。 求若干次操作后该数列的$n$个数是否可能都为$0$。可能则输出$YES$，否则输出$NO$。

题目描述

You are given an array $ a_1, a_2, \ldots, a_n $ . In one operation you can choose two elements $ a_i $ and $ a_j $ ( $ i \ne 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.

输入输出格式

输入格式

The first line contains a single integer $ n $ ( $ 2 \le n \le 10^5 $ ) — the size of the array. The second line contains $ n $ integers $ a_1, a_2, \ldots, a_n $ ( $ 1 \le a_i \le 10^9 $ ) — the elements of the array.

输出格式

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

输入输出样例

输入样例 #1

4
1 1 2 2

输出样例 #1

YES

输入样例 #2

6
1 2 3 4 5 6

输出样例 #2

NO

说明

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.