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)

/* ex3-4
    kas056 */
#include <stdio.h>
int main(void){
    //積cross,フラグflagの設定
    int N,cross,flag;
    scanf("%d",&N);

    //flagの初期値設定
    flag = 0;
    /*1<=i<=9の範囲内のiと、1<=j<=9の範囲内のjで
    九九を全て表すことが出来る。ループを用いて積を出す。*/
    for(int i = 1; i < 10 ; i ++){
        for (int j = 1; j<10; j++){
            cross = i * j;
            if (N == cross){//Nとcrossが一致したら
                flag = 1;//フラグを立てる
            }
        }
    }
    if (flag == 1){//フラグがたっていたら
        printf("%s\n","Yes");//Yesを出力
    }
        
    else{//立ってなかったら
        printf("%s\n","No");//Noを出力
    }

    return 0;
}