Problem:
Score : 100 points

Problem Statement

Iroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.

To create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.

Constraints

1≦A,B,C≦10

Input

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

A B C

Output

If it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.

Sample Input 1

5 5 7

Sample Output 1

YES

Using three phrases of length 5, 5 and 7, it is possible to construct a Haiku.

Sample Input 2

7 7 5

Sample Output 2

NO

Solution in Haskell (GHC 7.10.3) (judge verdict: Accepted)

contain_5_7_5 :: [Int] -> Bool
-- Implement code below
contain_5_7_5 arr = cnt 5 arr == 2 && cnt 7 arr == 1
cnt x arr = sum [1 | y <- arr, y == x]




-- IO related, you don't have to modify it.
main = getLine >>= putStrLn. f. contain_5_7_5. map read. words
  where f True = "YES"
        f False = "NO"