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 C (GCC 5.4.1) (judge verdict: Accepted)

// 課題3_4 AtCoder Beginner Contest 144 B - 81
// nk777
 
#include <stdio.h>
 
int main(void){
    // 整数Nを格納num,カウンタi_count, 結果格納result
    int num, i_count, result = 0;
 
    // nを受け取る
    scanf("%d", &num);
 
    for (i_count = 1; i_count < 10; i_count++)
    {
        // iの段を調べる
        // num/iの商が整数で1以上9以下
        if (num % i_count == 0 && 0 < num / i_count && num / i_count < 10)
        {
            result = 1;
            break;
        }
    }
    if (result == 1)
    {
        printf("Yes\n");
    }
    else
    {
        printf("No\n");
    }
    
    return 0;
}