100470: [AtCoder]ABC047 A - Fighting over Candies

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:1 Solved:0

Description

Score : $100$ points

Problem Statement

Two students of AtCoder Kindergarten are fighting over candy packs.

There are three candy packs, each of which contains $a$, $b$, and $c$ candies, respectively.

Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.

Note that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.

Constraints

  • $1 ≦ a, b, c ≦ 100$

Input

The input is given from Standard Input in the following format:

$a$ $b$ $c$

Output

If it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.


Sample Input 1

10 30 20

Sample Output 1

Yes

Give the pack with $30$ candies to one student, and give the two packs with $10$ and $20$ candies to the other. Then, each gets $30$ candies.


Sample Input 2

30 30 100

Sample Output 2

No

In this case, the student who gets the pack with $100$ candies always has more candies than the other.

Note that every pack must be given to one of them.


Sample Input 3

56 25 31

Sample Output 3

Yes

Input

题意翻译

输入三个数,如果存在其中两个数的和等于第三个数,输出Yes,不存在,输出No,强调一下,岛国的题最后输出要记得换行,否则听取WA声一片

加入题单

算法标签: