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
   seira3 */

#include<stdio.h>
#include<stdlib.h>

int main(void){
    int number; //変数宣言
    scanf("%d",&number); //numberに入力
    int count=0; //カウンターを宣言
    for(int i=1;i<10;i++){ //iで割り切れてかつ商が1から9におさまるならcountに1を足す
        if(0<number/i&&10>number/i&&number%i==0){
            count++;
        }
    }
    if(count==0){ //countに一回も足されなかった時はNo
        printf("%s\n","No");
    }
    else{ //それ以外はYes
        printf("%s\n","Yes");
    }
    return 0;
}