#include <iostream>
using namespace std;
 
int main(){
int N;
cin >> N;
for(int i=1; i<10; i++ ){
	for(int k=1;k<10;k++){
		if(i*k==N){
			cout << "Yes";
			return 0;
		}
	}
}
cout << "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 <iostream>
using namespace std;
 
int main(){
int N;
cin >> N;
for(int i=1; i<10; i++ ){
	for(int k=1;k<10;k++){
		if(i*k==N){
			cout << "Yes";
			return 0;
		}
	}
}
cout << "No";	
return 0;	
	
}
```