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 (Clang 3.8.0) (judge verdict: Wrong Answer)

#include<stdio.h>
int main()
{
	int n,i,j,k=0,leap=0;
	int a[100]={};
	for(i=1;i<=9;i++){
		for(j=1;j<=9;j++){
			a[k]=i*j;
			k++;
		}
	}
	while(~scanf("%d",&n)){
		for(i=0;i<81;i++){
			if(a[i]==n){
				leap=1;
				break;
			}
		}if(leap==1){
			printf("YES\n");
		}else{
			printf("NO\n");
		}leap=0;
	}
}