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)

/*ex3_4
ryo_1129*/
#include <stdio.h>

int main(void){
	int N; //変数宣言
	scanf("%d",&N); //入力
	int divisor = 1; //割る数、
	//割る数が1以上９以下の間
	while(divisor <= 9){
		//余りが０かつ商が１以上９以下の場合、Yesと表示する 
		if(N / divisor !=0 && N % divisor == 0 && N / divisor <= 9){
			printf("Yes\n");
			break;
		}
		divisor++; //割る数を１増やす
	}
	// Yesが表示されなかった場合、Noを表示する。
	if(divisor == 10){
		printf("No\n");
	}
	return 0;
}