#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;
vector<long long> f = {3,5,17,257,65537};

long long rec(int pos, long long val, long long n){
	if(val > n) return 0;
	if(pos == f.size()){
		if(val<3) return 0;
		return 1;
	}

	long long ret = 0;
	ret += rec(pos+1, val, n);
	ret += rec(pos+1, val*f[pos], n);

	return ret;
}

int main(){
	long long n;
	cin >> n;


	long long ans = 0;
	for(int i=0; i<32; i++){
		ans += rec(0, 1LL<<i, n);
	}

	cout << ans << endl;


	return 0;
}