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
        fmuacshai */
 
#include<stdio.h>
 
int main(void){
    //整数number、割る数div_number、商quotient
    int number,div_number,quotient;
    //numberの入力
    scanf("%d",&number);
    //div_numberの初期設定
    div_number=9;
    //余りが出なくなるまで計算
    while(number%div_number>0){
        div_number=div_number-1;
    }
    //quotientの計算
    quotient=number/div_number;
    //quotientが10未満ならYes、10以上ならNoと出力
    if(quotient<10){
        printf("Yes\n");
    }else{
        printf("No\n");
    }
    return 0;
}