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: Wrong Answer)

#include <stdio.h>
int main()
{
    int n;
    scanf("%d",&n);

    if(n==1*1 || n==2*2 || n==3*3 || n==4*4 ||n==5*5 ||n==6*6|| n==7*7||n==8*8||n==9*9)
    {
        printf("Yes");

    }
    else if (n==10||n==20||n==30||n==40)
        {
            printf("Yes");
        }
    else
    {
        printf("No\n");
    }
     return 0;
}