H. Inscribed triangle 3
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Lets take an arbitrary nondegenerate triangle and lets draw the closed polyline with three segments with the following rules:

  1. each side of the triangle must have at least one vertex of the polyline;
  2. each vertex of the polyline must lie on some triangle's side;
  3. the total length of all segments of the polyline must be minimum possible;
  4. if there are several such polylines, one with minimal product of lengths of its segments must be chosen.

Determine, if there exists a triangle whose lengths of segments of the polyline can be equal to $$$a$$$, $$$b$$$, $$$c$$$?

Input

The first line of the input file contains three integer numbers $$$a$$$, $$$b$$$, $$$c$$$ ($$$-1\,000 \leq a, b, c \leq 1\,000$$$).

Output

Output "Yes" if the lengths of segments of the polyline can be equal to $$$a$$$, $$$b$$$, $$$c$$$ or "No" otherwise.

Examples
Input
2 3 4
Output
Yes
Input
-1 -1 -1
Output
No