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>
#include<stdlib.h>

int main(void){
    int N,q = 0;
    scanf("%d",&N);
    switch (N)
    {
    case 1:
        q = 1;
        break;
    case 2:
        q = 1;
        break;
    case 3:
        q = 1;
        break;
    case 4:
        q = 1;
        break;
    case 5:
        q = 1;
        break;
    case 6:
        q = 1;
        break;
    case 7:
        q = 1;
        break;
    case 8:
        q = 1;
        break;
    case 9:
        q = 1;
        break;
    case 10:
        q = 1;
        break;
    case 12:
        q = 1;
        break;
    case 14:
        q = 1;
        break;
    case 15:
        q = 1;
        break;
    case 16:
        q = 1;
        break;
    case 18:
        q = 1;
        break;
    case 20:
        q = 1;
        break;
    case 21:
        q = 1;
        break;
    case 24:
        q = 1;
        break;
    case 25:
        q = 1;
        break;
    case 27:
        q = 1;
        break;
    case 28:
        q = 1;
        break;
    case 30:
        q = 1;
        break;
    case 32:
        q = 1;
        break;
    case 35:
        q = 1;
        break;
    case 36:
        q = 1;
        break;
    case 40:
        q = 1;
        break;
    case 42:
        q = 1;
        break;
    case 45:
        q = 1;
        break;
    case 48:
        q = 1;
        break;
    case 49:
        q = 1;
        break;
    case 54:
        q = 1;
        break;
    case 56:
        q = 1;
        break;
    case 63:
        q = 1;
        break;
    case 64:
        q = 1;
        break;
    case 72:
        q = 1;
        break;
    case 81:
        q = 1;
        break;
    }
    if(q == 1) printf("Yes");
    else printf("No");
    return 0;
}