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)

/*  ex3_4
    potter0723sw  */

//方針：Nを１〜９で割ってみて商が１〜９かつ余りが０か調べる

#include <stdio.h>

int main(void) {
	int N,quotient,remainder,d;//dはdevide
	scanf("%d", &N);
	d = 1;
	while(d <= 9){//1~9まで調べる
		quotient = N / d;//商
    	remainder = N % d;//余り
    	if(quotient >= 1 && quotient <= 9 && remainder == 0){//商が１〜９かつ余りが０
            printf("yes\n");
            break;//yesを出力してwhile脱出
        }
		d += 1;
    }
    if(d == 10){//１〜９まで試してダメだった場合d=10なのでその時にnoを出力
        printf("no\n");
    }
	return 0;
}