#include <cassert>
#include <functional>
#include <set>
#include <ctime>
#include <cmath>
#include <climits>
#include <cstring>
#include <string>
#include <queue>
#include <map>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstdio>
#ifndef ONLINE_JUDGE //POJ
# include <complex>
# include <random>
# include <array>
# define mkt make_tuple
# define empb emplace_back
#endif
#ifdef _LOCAL
# include "for_local.h"
#else
# define debug if (false)
#endif
using namespace std;
typedef unsigned int uint; typedef long long ll; typedef unsigned long long ull;
#define repi(_I, _B, _E) for(int _I = (_B); (_I) < (_E); ++ (_I))
#define rep(_I, _N) for(int _I = 0; (_I) < (_N); ++ (_I))
#define mkp make_pair
#define all(_X) (_X).begin(), (_X).end()

bool is_prime(ll n)
{
	for ( ll i = 2; i * i <= n; ++i ) {
		if ( n % i == 0 ) return false;
	}
	return (n > 1);
}
vector<ull> fps;
set<ull> bak;

ull solve(int n)
{
	{
		int j = 0;
		for(int i = 0; ; ++i){
			ull fp = (1ULL << (1ULL << i)) + 1;
			if ( fp > n ) break;
			if ( is_prime(fp) ) {
				fps.push_back(fp);
			}
		}
	}
	ull cnt = 0;

	rep(s, 1 << fps.size())
	{
		ull prod = 1;
		rep(i, fps.size())
		{
			if ( s & (1 << i) ) {
				prod *= fps[i];
			}
		}

		while ( 0 < prod && prod <= n ) {
			if ( prod > 2 ) {
				debug { assert(bak.count(prod) == 0); bak.insert(prod); }
				++cnt;
			}
			prod *= 2;
		}
	}
	return cnt;
}

signed main()
{
	int n;
	cin >> n;
	cout << solve(n) << endl;
	return 0;
}