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;
    scanf("%d",&N);

    if(N==1 || N==2|| N==3|| N==4|| N==5|| N==6|| N==7|| N==8|| N==9|| N==10|| N==12|| N==14|| N==15|| N==16|| N==18|| N==20|| N==21|| N==24|| N==25|| N==27|| N==28|| N==30|| N==32|| N==35|| N==36|| N==40|| N==42|| N==45|| N==48|| N==49|| N==54|| N==56|| N==63|| N==64|| N==72|| N==81){
        printf("Yes");
    }

    else{
        printf("No");
    }
}