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

#include <stdio.h>

int main(void){

    int num;
    int count;  // loop count
    char yesOrNo = 'n'; // flag

    // input N
    scanf("%d", &num);

    // check N can be divided each number
    for(count = 1; count <= 9; count++){
        if(num % count == 0){
            // check another one is under 10
            if(num / count < 10){
                // change flag
                yesOrNo = 'y';
            }
        }
    }

    // branch by flag
    if(yesOrNo == 'y'){
        printf("Yes\n");
    }else{
        printf("No\n");
    }

    return 0;
}