Problem about problems

Limits: 2 sec., 256 MiB

This statement was translated automatically from Ukrainian.

Vasyl thought about problems for the world programming semifinal for a long time and finally came up with as many as three. The first problem has difficulty \(a\), the second — \(b\), the third — \(c\).

Vasyl would gladly add all three problems to the competition, but according to the rules for creating problems for the world programming semifinal, Vasyl can add exactly two problems with a total difficulty of at most 47.

Help Vasyl determine if he can choose two problems such that their total difficulty does not exceed 47.

Input

The single line contains three integers \(a\), \(b\), \(c\) — the difficulties of the problems.

Output

Print YES, if Vasyl can choose two problems that meet the rules, or NO — otherwise.

Constraints

\(1 \le a, b, c \le 47\).

Samples