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<stdio.h>
int main()
{
    int N;

    scanf("%d", &N);

    if(N<=9)
        printf("Yes\n");
    else if(N>9)
    {
        if(N/2<=9 && N%2==0)
        printf("Yes\n");
    else if(N/3<=9 && N%3==0)
        printf("Yes\n");
    else if(N/4<=9 && N%4==0)
        printf("Yes\n");
    else if(N/5<=9 && N%5==0)
        printf("Yes\n");
    else if(N/6<=9 && N%6==0)
        printf("Yes\n");
    else if(N/7<=9 && N%7==0)
        printf("Yes\n");
    else if(N/8<=9 && N%8==0)
        printf("Yes\n");
    else if(N/9<=9 && N%9==0)
        printf("Yes\n");
    else
         printf("No\n");
    }

    return 0;

}