// *
// *
// *  Created By :hozaifa wahid
// * "mai maut ko takia aur kafan ko chadar banakar sota hu" 
// *------------------------------------
// *  OS : Ubuntu 16.04
// *  Language : CPP14
// *  Editor : Sublime Text 3
// *  C++ compiler : g++
// *https://www.geeksforgeeks.org/space-and-time-efficient-binomial-coefficient/
// *https://www.geeksforgeeks.org/binomial-coefficient-dp-9/
//https://www.geeksforgeeks.org/compute-ncr-p-set-2-lucas-theorem/
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define inf 1000000007
#define fr first
#define sc second
#define eps 1e-9
#define clr(a) memset(a, 0, sizeof(a))
#define sz(x) x.size()
#define sni(x) scanf("%d",&x)
#define snl(x) scanf("%lld", &x)
#define snc(x) scanf("%c", &c);
#define rep(n) for(int i = 0 ; i < n ;i ++)
#define repc(i, n) for(int i = 0 ; i < n ; i ++)
#define FOR(i, x, y) for(int i = x ; i < y ; i ++)
#define DEC(i, x, y) for(int i = x ; i >= y ; i --)
#define all(v) v.begin(), v.end()
#define min3(a, b, c) min(a, min(b,c))
#define max3(a, b, c) max(a, max(b, c))
#define alla(a, n) a, a+n
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
ll MOD=1000000007;
ll C[2005][2005];
ll min(ll a,ll b)
{
 return a<b?a:b;
}

 
ll pw(ll a,ll b){
    if(b==0) return 1;
    ll x=pw(a,b/2);
    x=(x*x)%MOD;
    if(b%2) x=(x*a)%MOD;
    return x;
}
ll comb2(ll n,ll k, ll x)
{
ll res = 1LL; 
  
   
    if ( k > n - k ) 
        k = n - k; 
  
   
    for (int i = 0; i < k; ++i) 
    { 
        res = (res%MOD*(n - i)%MOD)%MOD; 
        res =(res%MOD* pw((i + 1),MOD-2)%MOD)%MOD; 
    } 
  
    //return res; 
return res%MOD;
}
void comb(ll n, ll k) 
{ 
    //int C[n+1][k+1]; 
    ll i, j; 
  
    // Caculate value of Binomial Coefficient in bottom up manner 
    for (i = 0; i <= n; i++) 
    { 
        for (j = 0; j <= min(i, k); j++) 
        { 
            // Base Cases 
            if (j == 0 || j == i) 
                C[i][j] = 1LL; 
  
            // Calculate value using previosly stored values 
            else
                C[i][j] = (C[i-1][j-1]%MOD + C[i-1][j]%MOD)%MOD; 
        } 
    } 
  
   // return C[n][k]; 
} 
ll phi(ll n) 
{ 
    ll result = n; // Initialize result as n 
  
    // Consider all prime factors of n and subtract their 
    // multiples from result 
    for (ll p = 2; p * p <= n; ++p) { 
          
        // Check if p is a prime factor. 
        if (n % p == 0) { 
              
            // If yes, then update n and result 
            while (n % p == 0) 
                n /= p; 
            result -= result / p; 
        } 
    } 
  
    // If n has a prime factor greater than sqrt(n) 
    // (There can be at-most one such prime factor) 
    if (n > 1) 
        result -= result / n; 
    return result; 
} 
struct node 
{ 
    int val; 
    int level; 
}; 
  
// Returns minimum number of operations 
// needed to covert x into y using BFS 
int minOperations(int x, int y) 
{ 
    // To keep track of visited numbers 
    // in BFS. 
    set<int> visit; 
  
    // Create a queue and enqueue x into it. 
    queue<node> q; 
    node n = {x, 0}; 
    q.push(n); 
  
  
    // Do BFS starting from x 
    while (!q.empty()) 
    { 
        // Remove an item from queue 
        node t = q.front(); 
        q.pop(); 
  
        // If the removed item is target 
        // number y, return its level 
        if (t.val == y) 
            return t.level; 
  
        // Mark dequeued number as visited 
        visit.insert(t.val); 
  
        // If we can reach y in one more step 
        if (t.val*2 == y || t.val-1 == y) 
            return t.level+1; 
  
        // Insert children of t if not visited 
        // already 
        if (visit.find(t.val*2) == visit.end()) 
        { 
            n.val = t.val*2; 
            n.level = t.level+1; 
            q.push(n); 
        } 
        if (t.val-1>=0 && visit.find(t.val-1) == visit.end()) 
        { 
            n.val = t.val-1; 
            n.level = t.level+1; 
            q.push(n); 
        } 
    } 
} 
struct compare
{
bool operator()(const pair<ll,ll>&a,const pair<ll,ll>&b)
{
    if(a.first<b.first)
    return true;
    else if(a.first==b.first and a.second>b.second)
    return true;
    else
    return false;
}
};
void solve()
{
//comb(2001,2001);
std::ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    ll a,b;
    cin>>a;
    ll flg=0;
    FOR(i,1,10)
    FOR(j,1,10)
    if(i*j==a)
    flg=1;
    if(flg)
    cout<<"Yes";
    else
    cout<<"No";
}


int main(){
    std::ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    
    solve();
    
}












Measured memory_bytes: 256