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 <stdio.h>

int main(void)
{
  int kuku[81];
  for(int i = 1;i <= 9; i++){
    for(int k = 1;k <= 9; k++){
      kuku[(i-1)*9+k-1] = i * k;
    }
  }
  
  int N;
  scanf("%d", &N);
  
  int isgood  = 0;
  
  for(int i = 0; i<81; i++){
    if(kuku[i] == N){
      isgood = 1;
      break;
    }
  }
  
  if(isgood){
    printf("Yes");
  }else{
    printf("No");
  }
  
  return 0;
}