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)

#include<stdio.h>

int main(void)
{
    int n = 0;
    int i = 0;
    int j = 0;
    int qq[9][9];
    int cnt = 0;

    scanf("%d",&n);

    for(i=0;i<9;i++){
        for(j=0;j<9;j++){
            //printf("hairetu[%d][%d]  %d * %d \n",i,j,i+1,j+1);
            qq[i][j] =(i+1)*(j+1);
            //printf("%d\n",qq[i][j]);
        }
    }
    for(i=0;i<9;i++){
        for(j=0;j<9;j++){
            if(qq[i][j] == n){
              printf("Yes");
              cnt++;
              return 0;
            }
        }
    }
    if(cnt != 1 || cnt != 2) printf("No");


    return 0;
}