#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <iomanip>
using namespace std;

#define MAXV 1000000000
using ll = long long;

ll fib[51];
ll beki[43];
int main() {
	ll N; cin >> N;
	map<ll, int> mp;
	fib[0] = 3;
	fib[1] = 5;
	fib[2] = 17;
	fib[3] = 257;
	fib[4] = 65537;
	
	beki[0] = 1;
	for (int i = 1; i < 43; ++i) {
		beki[i] = beki[i - 1] * 2;
	}
	for (int i = 0; i < 43; ++i) {
		
		
		for (int bit = 0; bit < (1 << 5); ++bit) {
			ll t = 1;
			for (int j = 0; j < 5; ++j) {
				if (bit >> j & 1) t *= fib[j];
			}
			if (t*beki[i] >= 3 && t*beki[i] <= N) mp[t*beki[i]]++;

		}
	}
	cout << mp.size() << endl;
}