#include<bits/stdc++.h>
#define ull unsigned long long
using namespace std;
const int N=1e8+5;
ull n,m,sum,p[N];
int ans;
bool pd[N];
void sieve(ull x){//ËØÊý 
	for(int i=2;i<=x;i++){
		if(!pd[i])p[++sum]=i;
		for(int j=1;j<=sum&&p[j]*i<=x;j++){
			pd[i*p[j]]=1;
			if(i%p[j]==0)break;
		}
	}
}
bool is_pal(ull x){//»ØÎÄÊý 
	string s1=to_string(x);string s2=s1;
	reverse(s2.begin(),s2.end());
	if(s1==s2)return true;
	else return false;
}
bool is_meet(ull x,short r){//·ênÊý 
	string s=to_string(x);
	if(s.find(r+'0')!=string::npos||x%r==0)return true;
	else return false;
}
bool is_odi(ull x){//ÆæÊýλÊý&żÊýλÊý 
	string s=to_string(x);
	if(s.size()%2)return true;
	else return false;
}
int main(){
	freopen("seven.in","r",stdin);
	freopen("seven.out","w",stdout);
	ios::sync_with_stdio(false);
	cout.tie(0);cin>>n;
	sieve(n);
	for(int i=1;i<=sum;i++)
		if(is_pal(p[i])&&is_meet(p[i],7)&&is_odi(p[i]))ans++;
	cout<<ans;
	return 0;
}