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 9.2.1) (judge verdict: Accepted)

#include <iostream>
using namespace std;

int main()
{
   int N ;
   cin >> N;
   bool is_ok = 0;
   for (int i = 1 ; i <= 9 ; ++i){
      if ((N%i==0) && (N/i <= 9)){
         is_ok = 1;
         break ;
      }
   }
   if (is_ok){
      cout << "Yes" << endl;
   }
   else
   {
      cout << "No" << endl;
   }
}