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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

// ABC144_B
#include <bits/stdc++.h>

using namespace std;

int main() {
    int N,i;
    cin >> N;
    if (1 <= N && N < 82 && N != 50 && N!=60 && N != 70 && N != 80   ) {
        if (N % 9 == 0 || N % 8 == 0 || N % 7 == 0 || N % 6 == 0 || N % 5 == 0 || N % 5 == 0 || N % 4 == 0 || N % 3 == 0 || N % 2 == 0) {
            while (N % 2 == 0){ // 偶数の素数は2のみ
                //printf("2 *");
                N /= 2;
            }
            for ( i = 3; i <= N; i++){ // 他の素数で割っていく
                while (N % i == 0){
                  // printf("%d *", i);
                    N /= i;
                }
            }
            if(i < 10 ){
            cout << "Yes" << endl;
        }else{
                cout << "NO" << endl;
            }
        }
        else cout << "NO" <<endl;

    } else {
        cout << "NO" << endl;
    }

}