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

int main() {
	int n;
	scanf("%d", &n);
	
	bool chk = false;
	for(int i=1;i<=9;i++)
		if(n%i==0 && n/i<=9) chk = true;
	
	puts(chk ? "Yes" : "No");
	
	return 0;
}
### Prompt

Please provide a Cpp coded solution to the problem described below:

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 main() {
	int n;
	scanf("%d", &n);
	
	bool chk = false;
	for(int i=1;i<=9;i++)
		if(n%i==0 && n/i<=9) chk = true;
	
	puts(chk ? "Yes" : "No");
	
	return 0;
}
```