#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;

int main(){
	int a;scanf("%d",&a);
	int isprime[100001]={};isprime[2]=1;for(int i=3;i<=100000;i+=2)isprime[i]=1;
	for(int i=3;i*i<=100000;i+=2){
		if(isprime[i])for(int j=i*i;j<=100000;j+=j)isprime[j]=0;
	}
	vector<int> v(1,3);
	for(int i=1,shif=2;i<5;i++){
		if(isprime[(shif<<=(1<<(i-1)))+1])v.push_back(shif+1);
	}
	int dp[1<<10]={},n=1<<v.size(),ans=0;
	for(int i=1;i<n;i++){
		if(!dp[i]){
			dp[i]=1;for(int j=0;i>>j;j++)if((i>>j)&1){if((long long)dp[i]*v[j]>a)goto cntn;else dp[i]*=v[j];}
			for(int j=0;((long long)dp[i]<<j)<=a;j++){ans++;}
		}
		cntn:;
	}
	printf("%d\n",ans+(int)(log(a)/log(2))-1);

	
	return 0;
}