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(){
	int n,i,a[100][2],b=0,f=0;
	scanf("%d",&n);
	for(i=1;i<n;i++){
		if(n%i==0){
			a[b][0]=i;
			a[b][1]=n/i;
			b++;
			}
		}
	for(i=0;i<b;i++){
		if(a[i][0]<=9&&a[i][0]>=1&&a[i][1]<=9&&a[i][1]>=1){
			f=1;
			break;
		}}
	if(f==1||n==1)printf("Yes\n");
	if(f==0&&n!=1) printf("No\n");
	
	
	
	
	
	 
	
	
	
	
	
	
	
	
	
	
	
	
	
}