Problem:
Score : 200 points

Problem Statement

Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together.

Given an integer N, determine whether N can be represented as the product of two integers between 1 and 9. If it can, print Yes; if it cannot, print No.

Constraints

1 \leq N \leq 100

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

If N can be represented as the product of two integers between 1 and 9 (inclusive), print Yes; if it cannot, print No.

Sample Input 1

10

Sample Output 1

Yes

10 can be represented as, for example, 2 \times 5.

Sample Input 2

50

Sample Output 2

No

50 cannot be represented as the product of two integers between 1 and 9.

Sample Input 3

81

Sample Output 3

Yes

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

f m
    | m < 10 = "Yes"
    | m `mod` 2 == 0, m < 20 = "Yes"
    | m `mod` 3 == 0, m < 30 = "Yes"
    | m `mod` 4 == 0, m < 40 = "Yes"
    | m `mod` 5 == 0, m < 50 = "Yes"
    | m `mod` 6 == 0, m < 60 = "Yes"
    | m `mod` 7 == 0, m < 70 = "Yes"
    | m `mod` 8 == 0, m < 80 = "Yes"
    | m `mod` 9 == 0, m < 90 = "Yes"
    | otherwise = "No"
        
main = do
    m <- read <$> getLine :: IO Int
    putStrLn $ f m