#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <ctime>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <unordered_set>
#include <cstring>
#include <vector>
#include <algorithm>
#include <functional>
#include <fstream>
#include <sstream>
#include <complex>
#include <bitset>
#include <stack>
#include <queue>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rev(i,n) for(int i=(n)-1;(i)>=0;(i)--)
#define all(a) (a).begin(),(a).end()
#define pb(a) push_back(a)
#define bitcount(b) __builtin_popcount(b)
template<typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; }
template<typename T> void operator>>(vector<T>& a, int b) {while(b--)if(!a.empty())a.pop_back();}
bool isprime(int n){ if(n<2)return false;  for(int i=2;i*i<=n;i++)if(n%i==0)return false;  return true;} 

long long pw(long long a,long long b){
	return b ? pw(a*a,b/2) * (b&1?a:1) : 1;
}


int main(){
	vector<long long> p;
	int n = 0;
	while( pw(2,pw(2,n)) + 1 <= 1e9 ){
		long long x = pw(2,pw(2,n)) + 1;
		if( isprime(x) ) p.push_back(x);
		n++;
	}
	long long l;
	cin >> l;
	int ans = 0;
	for(int i = 0 ; i < (1<<p.size()) ; i++){
		long long v = 1;
		for(int j = 0 ; j < p.size() ; j++)
			if( i >> j & 1 ) v *= p[j];
		while(v<=l ){
			if( v >= 3 ) ans++;
			v *= 2;
		}
	}
	cout << ans << endl;

}