#include "bits/stdc++.h"
using namespace std;

int n;

int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		if(n%i!=0) continue;
		int d1=i,d2=n/i;
		if(max(d1,d2)<10) return 0 * printf("Yes");
	}
	printf("No");
}
### Prompt

Please create a solution in CPP to the following problem:

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`.

Examples

Input

10


Output

Yes


Input

50


Output

No


Input

81


Output

Yes

### Response

```cpp
#include "bits/stdc++.h"
using namespace std;

int n;

int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		if(n%i!=0) continue;
		int d1=i,d2=n/i;
		if(max(d1,d2)<10) return 0 * printf("Yes");
	}
	printf("No");
}
```