#include<bits/stdc++.h>
using namespace std;
int main(){
  int n;
  cin >> n;
  string s="No";
  for(int i=1; i<=9; i++){
    for(int j=i; j<=9; j++){
      if(n==i*j) s="Yes";
    }
  }
  cout << s << endl;
}
### Prompt

Your challenge is to write a Cpp solution 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 main(){
  int n;
  cin >> n;
  string s="No";
  for(int i=1; i<=9; i++){
    for(int j=i; j<=9; j++){
      if(n==i*j) s="Yes";
    }
  }
  cout << s << endl;
}
```