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)

#include <unistd.h>

int main()
{
    char buf[4] = {0};  // 入力バッファ（0で初期化）
    int N = 0;      // 入力された数値

    int len = 0;        // 入力された文字列の長さ
    int rank = 1;       // 位

    // 標準入力から4バイト読み込みバッファに格納
    read(0, buf, 4);

    // 入力された文字列の長さをはかる
    for (int i = 1; i < 4; i++) {
        if (buf[i] != 0) {
            len++;
        }
    }

    // Nに入力された数値を格納
    for (int i = len; i > 0; i--) {
        N += (int)((buf[i-1] - 0x30) * rank);   // 文字'0'はASCIIで0x30のため
        rank = rank * 10;
    }

    // 本題
    for (int i = 1; i < 10; i++) {
        for (int j = 1; j < 10; j++) {
            if (N == (i * j)) {
                write(1, "Yes\n", 4);
                return 0;
            }
        }
    }

    write(1, "No\n", 3);

    return 0;
}