Contest Duration: - (local time) (100 minutes) Back to Home
B - 81 /

Time Limit: 2 sec / Memory Limit: 1024 MB

制約

• 1 \leq N \leq 100
• N は整数である。

入力

N


出力

N1 以上 9 以下の 2 つの整数の積として表すことができるなら Yes を、できないなら No を出力せよ。

入力例 1

10


出力例 1

Yes


入力例 2

50


出力例 2

No


501 以上 9 以下の 2 つの整数の積として表すことはできません。

入力例 3

81


出力例 3

Yes


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