You are given three sticks with positive integer lengths l_1, l_2, and l_3.
Your task is to choose exactly one of these sticks and break it into two pieces such that:
Both new pieces have positive integer lengths.
The sum of the lengths of the two new pieces is equal to the length of the original stick.
After the break, you will have a total of four sticks. It must be possible to form a rectangle using these four sticks as its sides.
Note that a square is considered a rectangle.
Input
The input contains three integers l_1, l_2, l_3 (1 \le l_1, l_2, l_3 \le 10^9).
Output
Print "YES" if it is possible to break exactly one stick into two positive integer pieces to form a rectangle. Otherwise, print "NO".
Examples
| standard input | standard output |
|---|
| 1 1 2
| YES
|
| 1 1 1
| NO
|