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
    Graku   */
#include <stdio.h>
#include <math.h>

int main(void) {
    int n; //declaration
    scanf("%d", &n);

    int flag = 0; //if exist i, j in {x in N | 1 <= x <= 9} s.t. n == i * j, flag == 1, else flag == 0
    for (int i = 1; i <= 9; ++i) { //1 <= i <= 9
        if (flag) { //if already find (i, j) s.t. (i, j) s.t. n == i * j, break
            break;
        }
        for (int j = i; j <= 9; ++j) { //i <= j <= 9, dont have to check (i, j) s.t. i > j
            if (n == i * j) { //if find (i, j) s.t. n == i * j, flag = 1
                flag = 1;
                break;
            }
        }
    }

    if (flag) {
        printf("Yes\n");
    }
    else {
        printf("No\n");
    }

    return 0;
}