No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Kitahara Haruki's Gift

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputKitahara 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).

Examples

Input

3

100 200 100

Output

YES

Input

4

100 100 100 200

Output

NO

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.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/05/2021 09:55:46 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|