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: Wrong Answer)

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