#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int(i)=0;i<(n);i++)

int main(){
  int ans,f=0;cin>>ans;
  REP(i,9)REP(j,9) if((i+1)*(j+1)==ans) f=1;
  cout<<(f?"Yes":"No");  
}
### Prompt

Create a solution in cpp for 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;
#define REP(i,n) for(int(i)=0;i<(n);i++)

int main(){
  int ans,f=0;cin>>ans;
  REP(i,9)REP(j,9) if((i+1)*(j+1)==ans) f=1;
  cout<<(f?"Yes":"No");  
}
```