Codeforces Round 248 (Div. 2)
A
Kitahara Haruki's Gift
Codeforces
1100
原题
←B →
翻译中…

Kitahara Haruki has bought $*n*$ apples for Touma Kazusa and Ogiso Setsuna. Now he wants to divide all the apples between the friends.

翻译中…

Each apple weights 100 grams or 200 grams. Of course Kitahara Haruki doesn't want to offend any of his friend. Therefore the total weight of the apples given to Touma Kazusa must be equal to the total weight of the apples given to Ogiso Setsuna.

翻译中…

But unfortunately Kitahara Haruki doesn't have a knife right now, so he cannot split any apple into some parts. Please, tell him: is it possible to divide all the apples in a fair way between his friends?

翻译中…

Input

翻译中…

The first line contains an integer $*n*$ $(1 ≤ *n* ≤ 100)$ — the number of apples. The second line contains $*n*$ integers $*w*_{1}, *w*_{2}, ..., *w*_{*n*}$ ($*w*_{*i*} = 100$ or $*w*_{*i*} = 200$), where $*w*_{*i*}$ is the weight of the $*i*$-th apple.

翻译中…

Output

翻译中…

In a single line print "YES" (without the quotes) if it is possible to divide all the apples between his friends. Otherwise print "NO" (without the quotes).

翻译中…

Note

翻译中…

In the first test sample Kitahara Haruki can give the first and the last apple to Ogiso Setsuna and the middle apple to Touma Kazusa.

翻译中…

样例

Input #1
3
100 200 100
Output #1
YES
InputCopy OutputCopy
Input #2
4
100 100 100 200
Output #2
NO
InputCopy OutputCopy
题目信息
题号
433A
时间限制
1 s
内存限制
256 MB
标签
暴力
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。