stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    long long int n,m,s,c=0,i;

    cin>>n;

    for(i=1;i<10;i++){

        if(n%i==0)

        m=n/i;

        if(m>=1 && m<=9){

            cout<<"Yes\n";

            return 0;

        }

    }

    cout<<"No\n";

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.302322675022882x):
#include <stdio.h>



int main(){

	int n;

	scanf("%d", &n);

	int flag = 0;



	for (int i=1; i<10; i++){

		for (int j=i; j<10; j++){

			if (i*j == n){

				flag = 1;

				break;

			}

		}

		if (flag){

			break;

		}

	}



	if (flag){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main() {

	int r;

	bool band=false;

	cin>>r;

	for (int a=1; a<10;a++) {

		for (int b=1; b<10;b++) {

			if (a*b==r)

				band=true;

		}

	}

	if (band)

		cout<<"Yes";

	else

		cout<<"No";

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.318083054101105x):
#include<stdio.h>

int main(){

	int a, b, temp=0;

	scanf("%d", &a);

	for (int i=1; i<=9; i++){

		for(int j=1; j<=9; j++){

			if(i*j==a){

				temp=1;

				break;

			}

		}

	}

	if(temp == 1){

        puts("Yes");

    }

	else{

        puts("No");	

    }

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int n;



int main(){

    cin>>n;

    bool valid=false;

    for(int i=1;i<=9;i++){

        for(int j=1;j<=9;j++){

            if(i*j==n){

                valid=true;

            }

        }

    }

    if(valid){

        cout<<"Yes"<<endl;

    }else{

        cout<<"No"<<endl;

    }

}

// Faster C++ solution for the same problem (measured speedup: 5.288316127142928x):
#include<stdio.h>

int main(){

	int a, b, temp=0;

	scanf("%d", &a);

	for (int i=1; i<=9; i++){

		for(int j=1; j<=9; j++){

			if(i*j==a){

				temp=1;

				break;

			}

		}

	}

	if(temp == 1){

        puts("Yes");

    }

	else{

        puts("No");	

    }

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    long long int n,m,flag=0,i;

    cin>>n;

    for(i=9;i>0;i--)

    {

        if(n%i==0)

        {

            m=n/i;

            if(m>=1&&m<=9)

            {

                flag=1;

                break;

            }

        }

    }

    if(flag==1) cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.332584333597758x):
#include<stdio.h>

int main(){

	int a, b, temp=0;

	scanf("%d", &a);

	for (int i=1; i<=9; i++){

		for(int j=1; j<=9; j++){

			if(i*j==a){

				temp=1;

				break;

			}

		}

	}

	if(temp == 1){

        puts("Yes");

    }

	else{

        puts("No");	

    }

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int n,Count=0;

    cin>>n;

    for(int a=1; a<=9; ++a)

    {

        for(int b=1; b<=9; ++b)

        {

            if(a*b==n)

            {

                Count++;

            }

        }

    }

    if(Count==0)

    {

        cout<<"No"<<endl;

    }

    else

    {

        cout<<"Yes"<<endl;

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.331494888759877x):
#include<stdio.h>

int main(){

	int a, b, temp=0;

	scanf("%d", &a);

	for (int i=1; i<=9; i++){

		for(int j=1; j<=9; j++){

			if(i*j==a){

				temp=1;

				break;

			}

		}

	}

	if(temp == 1){

        puts("Yes");

    }

	else{

        puts("No");	

    }

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int n,flag=0,a=0,b=0;

    cin>>n;

    flag=0;

    for(int i=1; i<10; i++)

    {

        if(n%i==0)

        {

            a=n/i;

            b=i;



            if((a>=1&&a<=9)&&(b>=1&&b<=9))

            {

                cout<<"Yes"<<endl;

                flag=1;

                break;



            }

        }

        else continue;

    }

    if(flag==0) cout<<"No"<<endl;



}


// Faster C++ solution for the same problem (measured speedup: 5.331824097034853x):
#include<stdio.h>

int main(){

	int a, b, temp=0;

	scanf("%d", &a);

	for (int i=1; i<=9; i++){

		for(int j=1; j<=9; j++){

			if(i*j==a){

				temp=1;

				break;

			}

		}

	}

	if(temp == 1){

        puts("Yes");

    }

	else{

        puts("No");	

    }

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



typedef long long ll;

#define mp make_pair

#define pb push_back

#define pi pair<ll,ll>

#define ff first

#define ss second

#define MAX 100005

const ll MOD = 1000000007;



int main(){

	ios_base::sync_with_stdio(0); cin.tie(0);



	int t=1;

//	cin>>t;

	while(t--){

		int n;

		cin>>n;

		

		for(int i=1;i<=9;i++)

		{

			for(int j=1;j<=9;j++)

			{

				if(i*j==n)

			    {

			    	cout<<"Yes\n";

			    	return 0;

				}

			}

		}

		cout<<"No\n";

	 

	}		

}

// Faster C++ solution for the same problem (measured speedup: 5.396166785634928x):
#include<stdio.h>

int main(){

	int a, b, temp=0;

	scanf("%d", &a);

	for (int i=1; i<=9; i++){

		for(int j=1; j<=9; j++){

			if(i*j==a){

				temp=1;

				break;

			}

		}

	}

	if(temp == 1){

        puts("Yes");

    }

	else{

        puts("No");	

    }

	return 0;

}
// Slower C++ solution:
///in the name of ALLAH

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()

{

  //  ll p=100;

    //while(p--){

    ll t;

    cin>>t;

    bool f=0;

    for(int i=1;i<=9;i++)

    {

        if(t%i==0)

        {

            if(t/i>=1 && t/i<=9)

            {

                f=1;break;

            }

        }

    }

    if(f==1)

        cout<<"Yes"<<endl;

    else

        cout<<"No"<<endl;

}








// Faster C++ solution for the same problem (measured speedup: 5.332642480882853x):
#include<stdio.h>

int main(){

	int a, b, temp=0;

	scanf("%d", &a);

	for (int i=1; i<=9; i++){

		for(int j=1; j<=9; j++){

			if(i*j==a){

				temp=1;

				break;

			}

		}

	}

	if(temp == 1){

        puts("Yes");

    }

	else{

        puts("No");	

    }

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define ll long long



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);



    int n;

    cin>>n;

    for(int i = 1;i<= 9; i++){

        for(int j = 1; j <= 9; j++){

            if(i*j == n){

                cout<<"Yes"<<endl;

                return 0;

            }

        }

    }

    cout<<"No"<<endl;



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.404741979223707x):
#include<stdio.h>

int main(){

	int a, b, temp=0;

	scanf("%d", &a);

	for (int i=1; i<=9; i++){

		for(int j=1; j<=9; j++){

			if(i*j==a){

				temp=1;

				break;

			}

		}

	}

	if(temp == 1){

        puts("Yes");

    }

	else{

        puts("No");	

    }

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

int n;

cin>>n;

bool flag = 0;



for(int i=1 ; i<=9 ; i++){

    int div;

    if(n%i==0){

        div = n/i;

        if(div>=1 && div<=9)

            flag = 1;

    }

}



if(flag) cout<<"Yes"<<endl;

else cout<<"No"<<endl;



}


// Faster C++ solution for the same problem (measured speedup: 5.3336871981668414x):
#include<stdio.h>

int main(){

	int a, b, temp=0;

	scanf("%d", &a);

	for (int i=1; i<=9; i++){

		for(int j=1; j<=9; j++){

			if(i*j==a){

				temp=1;

				break;

			}

		}

	}

	if(temp == 1){

        puts("Yes");

    }

	else{

        puts("No");	

    }

	return 0;

}
// Slower C++ solution:
///Bismillahir Rahmanir Rahim

#include<bits/stdc++.h>

using namespace std;

#define     FAST        ios_base::sync_with_stdio(false);cin.tie(NULL)

#define     int 	    long long

#define 	pb 	        push_back

#define 	mp 	        make_pair

#define 	pi 	        2*acos(0.0)

#define     scan(i)     scanf("%lld",&i)

#define     scann(i,j)  scanf("%lld%lld",&i,&j)

#define     print(i)    printf("%lld\n",i)

#define     printt(i,j) printf("%lld %lld\n",i,j)

#define     loop(i,n) 	for(int i = 0 ; i <n ; i++)

#define     loopp(i,n) 	for(int i = 1 ; i <=n ; i++)

#define 	vect 	    vector<int>

#define 	vec_it 	    vector<int>::reverse_iterator vi

#define     sorta(v)    sort(v.begin(),v.end())

#define     sortd(v)    sort(v.begin(),v.end(),greater<>())

#define     sorted      is_sorted(v.begin(),v.end())

#define 	mapp 	    map<char,int>

#define 	pairr 	    pair<int,int>

#define 	sett	    set<int>

#define 	set_it 	    set<int>::reverse_iterator si

#define     map_it      map<char,int> :: reverse_iterator mi

#define 	yes 	    cout<<"Yes"<<endl

#define 	no 	        cout<<"No"<<endl

#define 	ff 	        first

#define 	ss 	        second

#define     mx          INT_MAX

#define     lmx         LLONG_MAX

#define     mn          INT_MIN

#define     lmn         LLONG_MIN

#define     GCD         __gcd(a,b)

#define     LCM         (a/GCD)*b

template <typename T> T gcd(T a,T b){return (b==0)?a:gcd(b,a%b);}

template <typename T> T lcm(T a,T b) {return a*(b/gcd(a,b));}

int modulo (int a, int b) { return a >= 0 ? a % b : ( b - abs ( a%b ) ) % b; }



void solve()

{

  //  freopen ("(input).txt" , "r",  stdin) ;

  //  string st,stt ;

  //  int low=0,high=0;

  //  int l=0,r;

    int n,k,t,x,y,z,d=0,temp=0,cnt=0,sum=0,f=0;

    cin>>n  ; vect v ,a ,b  ; sett s ; set_it ; mapp m,mm ;  map_it ; pairr p ;

    for(int i=1;i*i<=n;i++)

    {

        if(n%i==0&&i<10&&(n/i)<10)

            temp=1;

    }

    if(temp&1)

        yes;

    else

        no;



}



main()

{

    int t;

  //  cin>>t;

  //  while(t--)

        solve();

}




// Faster C++ solution for the same problem (measured speedup: 5.366970211903269x):
#include<stdio.h>

int main(){

	int a, b, temp=0;

	scanf("%d", &a);

	for (int i=1; i<=9; i++){

		for(int j=1; j<=9; j++){

			if(i*j==a){

				temp=1;

				break;

			}

		}

	}

	if(temp == 1){

        puts("Yes");

    }

	else{

        puts("No");	

    }

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    long long int sum=0,i,j,n,p,x1=0,flag=0;

    cin>>n;

    p=sqrt(n);

    for(i=1; i<=p; i++)

    {

        if(n%i==0 && i<10 && (n/i)<10)

        {

            flag=1;

            break;

        }

    }

    if(flag==1)

    {

        cout<<"Yes";

    }

    else

        cout<<"No";

    }


// Faster C++ solution for the same problem (measured speedup: 5.317383689790549x):
#include<stdio.h>

int main(){

	int a, b, temp=0;

	scanf("%d", &a);

	for (int i=1; i<=9; i++){

		for(int j=1; j<=9; j++){

			if(i*j==a){

				temp=1;

				break;

			}

		}

	}

	if(temp == 1){

        puts("Yes");

    }

	else{

        puts("No");	

    }

	return 0;

}
// Slower C++ solution:
 #include<bits/stdc++.h>

using namespace std;

int main()

{

   int n;

cin>>n;

for(int i = 1;i<=9;i++)

{

for(int j =1;j<=9;j++)

{

if(i*j==n){

cout<<"Yes"<<endl;

return 0;}

}

}

cout<<"No"<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.331601953602275x):
#include<stdio.h>

int main(){

	int a, b, temp=0;

	scanf("%d", &a);

	for (int i=1; i<=9; i++){

		for(int j=1; j<=9; j++){

			if(i*j==a){

				temp=1;

				break;

			}

		}

	}

	if(temp == 1){

        puts("Yes");

    }

	else{

        puts("No");	

    }

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    long long int n,m,s,c=0,i;

    cin>>n;

    for(i=1;i<10;i++){

        if(n%i==0)

        m=n/i;

        if(m>=1 && m<=9){

            cout<<"Yes\n";

            return 0;

        }

    }

    cout<<"No\n";

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.318832361494273x):
#include<stdio.h>

int main(){

	int a, b, temp=0;

	scanf("%d", &a);

	for (int i=1; i<=9; i++){

		for(int j=1; j<=9; j++){

			if(i*j==a){

				temp=1;

				break;

			}

		}

	}

	if(temp == 1){

        puts("Yes");

    }

	else{

        puts("No");	

    }

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main() {

	int r;

	bool band=false;

	cin>>r;

	for (int a=1; a<10;a++) {

		for (int b=1; b<10;b++) {

			if (a*b==r)

				band=true;

		}

	}

	if (band)

		cout<<"Yes";

	else

		cout<<"No";

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.294415536977819x):
#include <stdio.h>



int main(){

	

	int n;

	scanf("%d", &n);

	int poin = 0;

	

	for(int i = 1; i < 10; i++){

		for(int j = 1; j < 10; j++){

			if( i * j == n){

				poin = 1;

			}

		}

	}

	

	if(poin == 1){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int n;



int main(){

    cin>>n;

    bool valid=false;

    for(int i=1;i<=9;i++){

        for(int j=1;j<=9;j++){

            if(i*j==n){

                valid=true;

            }

        }

    }

    if(valid){

        cout<<"Yes"<<endl;

    }else{

        cout<<"No"<<endl;

    }

}

// Faster C++ solution for the same problem (measured speedup: 5.264781084305269x):
#include <stdio.h>



int main(){

	

	int n;

	scanf("%d", &n);

	int poin = 0;

	

	for(int i = 1; i < 10; i++){

		for(int j = 1; j < 10; j++){

			if( i * j == n){

				poin = 1;

			}

		}

	}

	

	if(poin == 1){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    long long int n,m,flag=0,i;

    cin>>n;

    for(i=9;i>0;i--)

    {

        if(n%i==0)

        {

            m=n/i;

            if(m>=1&&m<=9)

            {

                flag=1;

                break;

            }

        }

    }

    if(flag==1) cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.308852280197527x):
#include <stdio.h>



int main(){

	

	int n;

	scanf("%d", &n);

	int poin = 0;

	

	for(int i = 1; i < 10; i++){

		for(int j = 1; j < 10; j++){

			if( i * j == n){

				poin = 1;

			}

		}

	}

	

	if(poin == 1){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int n,Count=0;

    cin>>n;

    for(int a=1; a<=9; ++a)

    {

        for(int b=1; b<=9; ++b)

        {

            if(a*b==n)

            {

                Count++;

            }

        }

    }

    if(Count==0)

    {

        cout<<"No"<<endl;

    }

    else

    {

        cout<<"Yes"<<endl;

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.307767683808627x):
#include <stdio.h>



int main(){

	

	int n;

	scanf("%d", &n);

	int poin = 0;

	

	for(int i = 1; i < 10; i++){

		for(int j = 1; j < 10; j++){

			if( i * j == n){

				poin = 1;

			}

		}

	}

	

	if(poin == 1){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int n,flag=0,a=0,b=0;

    cin>>n;

    flag=0;

    for(int i=1; i<10; i++)

    {

        if(n%i==0)

        {

            a=n/i;

            b=i;



            if((a>=1&&a<=9)&&(b>=1&&b<=9))

            {

                cout<<"Yes"<<endl;

                flag=1;

                break;



            }

        }

        else continue;

    }

    if(flag==0) cout<<"No"<<endl;



}


// Faster C++ solution for the same problem (measured speedup: 5.308095426980029x):
#include <stdio.h>



int main(){

	

	int n;

	scanf("%d", &n);

	int poin = 0;

	

	for(int i = 1; i < 10; i++){

		for(int j = 1; j < 10; j++){

			if( i * j == n){

				poin = 1;

			}

		}

	}

	

	if(poin == 1){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



typedef long long ll;

#define mp make_pair

#define pb push_back

#define pi pair<ll,ll>

#define ff first

#define ss second

#define MAX 100005

const ll MOD = 1000000007;



int main(){

	ios_base::sync_with_stdio(0); cin.tie(0);



	int t=1;

//	cin>>t;

	while(t--){

		int n;

		cin>>n;

		

		for(int i=1;i<=9;i++)

		{

			for(int j=1;j<=9;j++)

			{

				if(i*j==n)

			    {

			    	cout<<"Yes\n";

			    	return 0;

				}

			}

		}

		cout<<"No\n";

	 

	}		

}

// Faster C++ solution for the same problem (measured speedup: 5.372151765843045x):
#include <stdio.h>



int main(){

	

	int n;

	scanf("%d", &n);

	int poin = 0;

	

	for(int i = 1; i < 10; i++){

		for(int j = 1; j < 10; j++){

			if( i * j == n){

				poin = 1;

			}

		}

	}

	

	if(poin == 1){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
///in the name of ALLAH

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()

{

  //  ll p=100;

    //while(p--){

    ll t;

    cin>>t;

    bool f=0;

    for(int i=1;i<=9;i++)

    {

        if(t%i==0)

        {

            if(t/i>=1 && t/i<=9)

            {

                f=1;break;

            }

        }

    }

    if(f==1)

        cout<<"Yes"<<endl;

    else

        cout<<"No"<<endl;

}








// Faster C++ solution for the same problem (measured speedup: 5.308910168704816x):
#include <stdio.h>



int main(){

	

	int n;

	scanf("%d", &n);

	int poin = 0;

	

	for(int i = 1; i < 10; i++){

		for(int j = 1; j < 10; j++){

			if( i * j == n){

				poin = 1;

			}

		}

	}

	

	if(poin == 1){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define ll long long



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);



    int n;

    cin>>n;

    for(int i = 1;i<= 9; i++){

        for(int j = 1; j <= 9; j++){

            if(i*j == n){

                cout<<"Yes"<<endl;

                return 0;

            }

        }

    }

    cout<<"No"<<endl;



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.380688796518791x):
#include <stdio.h>



int main(){

	

	int n;

	scanf("%d", &n);

	int poin = 0;

	

	for(int i = 1; i < 10; i++){

		for(int j = 1; j < 10; j++){

			if( i * j == n){

				poin = 1;

			}

		}

	}

	

	if(poin == 1){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

int n;

cin>>n;

bool flag = 0;



for(int i=1 ; i<=9 ; i++){

    int div;

    if(n%i==0){

        div = n/i;

        if(div>=1 && div<=9)

            flag = 1;

    }

}



if(flag) cout<<"Yes"<<endl;

else cout<<"No"<<endl;



}


// Faster C++ solution for the same problem (measured speedup: 5.309950236594661x):
#include <stdio.h>



int main(){

	

	int n;

	scanf("%d", &n);

	int poin = 0;

	

	for(int i = 1; i < 10; i++){

		for(int j = 1; j < 10; j++){

			if( i * j == n){

				poin = 1;

			}

		}

	}

	

	if(poin == 1){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
///Bismillahir Rahmanir Rahim

#include<bits/stdc++.h>

using namespace std;

#define     FAST        ios_base::sync_with_stdio(false);cin.tie(NULL)

#define     int 	    long long

#define 	pb 	        push_back

#define 	mp 	        make_pair

#define 	pi 	        2*acos(0.0)

#define     scan(i)     scanf("%lld",&i)

#define     scann(i,j)  scanf("%lld%lld",&i,&j)

#define     print(i)    printf("%lld\n",i)

#define     printt(i,j) printf("%lld %lld\n",i,j)

#define     loop(i,n) 	for(int i = 0 ; i <n ; i++)

#define     loopp(i,n) 	for(int i = 1 ; i <=n ; i++)

#define 	vect 	    vector<int>

#define 	vec_it 	    vector<int>::reverse_iterator vi

#define     sorta(v)    sort(v.begin(),v.end())

#define     sortd(v)    sort(v.begin(),v.end(),greater<>())

#define     sorted      is_sorted(v.begin(),v.end())

#define 	mapp 	    map<char,int>

#define 	pairr 	    pair<int,int>

#define 	sett	    set<int>

#define 	set_it 	    set<int>::reverse_iterator si

#define     map_it      map<char,int> :: reverse_iterator mi

#define 	yes 	    cout<<"Yes"<<endl

#define 	no 	        cout<<"No"<<endl

#define 	ff 	        first

#define 	ss 	        second

#define     mx          INT_MAX

#define     lmx         LLONG_MAX

#define     mn          INT_MIN

#define     lmn         LLONG_MIN

#define     GCD         __gcd(a,b)

#define     LCM         (a/GCD)*b

template <typename T> T gcd(T a,T b){return (b==0)?a:gcd(b,a%b);}

template <typename T> T lcm(T a,T b) {return a*(b/gcd(a,b));}

int modulo (int a, int b) { return a >= 0 ? a % b : ( b - abs ( a%b ) ) % b; }



void solve()

{

  //  freopen ("(input).txt" , "r",  stdin) ;

  //  string st,stt ;

  //  int low=0,high=0;

  //  int l=0,r;

    int n,k,t,x,y,z,d=0,temp=0,cnt=0,sum=0,f=0;

    cin>>n  ; vect v ,a ,b  ; sett s ; set_it ; mapp m,mm ;  map_it ; pairr p ;

    for(int i=1;i*i<=n;i++)

    {

        if(n%i==0&&i<10&&(n/i)<10)

            temp=1;

    }

    if(temp&1)

        yes;

    else

        no;



}



main()

{

    int t;

  //  cin>>t;

  //  while(t--)

        solve();

}




// Faster C++ solution for the same problem (measured speedup: 5.34308512810556x):
#include <stdio.h>



int main(){

	

	int n;

	scanf("%d", &n);

	int poin = 0;

	

	for(int i = 1; i < 10; i++){

		for(int j = 1; j < 10; j++){

			if( i * j == n){

				poin = 1;

			}

		}

	}

	

	if(poin == 1){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    long long int sum=0,i,j,n,p,x1=0,flag=0;

    cin>>n;

    p=sqrt(n);

    for(i=1; i<=p; i++)

    {

        if(n%i==0 && i<10 && (n/i)<10)

        {

            flag=1;

            break;

        }

    }

    if(flag==1)

    {

        cout<<"Yes";

    }

    else

        cout<<"No";

    }


// Faster C++ solution for the same problem (measured speedup: 5.293719285107709x):
#include <stdio.h>



int main(){

	

	int n;

	scanf("%d", &n);

	int poin = 0;

	

	for(int i = 1; i < 10; i++){

		for(int j = 1; j < 10; j++){

			if( i * j == n){

				poin = 1;

			}

		}

	}

	

	if(poin == 1){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
 #include<bits/stdc++.h>

using namespace std;

int main()

{

   int n;

cin>>n;

for(int i = 1;i<=9;i++)

{

for(int j =1;j<=9;j++)

{

if(i*j==n){

cout<<"Yes"<<endl;

return 0;}

}

}

cout<<"No"<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.307874272171254x):
#include <stdio.h>



int main(){

	

	int n;

	scanf("%d", &n);

	int poin = 0;

	

	for(int i = 1; i < 10; i++){

		for(int j = 1; j < 10; j++){

			if( i * j == n){

				poin = 1;

			}

		}

	}

	

	if(poin == 1){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    long long int n,m,s,c=0,i;

    cin>>n;

    for(i=1;i<10;i++){

        if(n%i==0)

        m=n/i;

        if(m>=1 && m<=9){

            cout<<"Yes\n";

            return 0;

        }

    }

    cout<<"No\n";

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.295161509664595x):
#include <stdio.h>



int main(){

	

	int n;

	scanf("%d", &n);

	int poin = 0;

	

	for(int i = 1; i < 10; i++){

		for(int j = 1; j < 10; j++){

			if( i * j == n){

				poin = 1;

			}

		}

	}

	

	if(poin == 1){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

}