#include <bits/stdc++.h>
using namespace std;

const int M = 5;
long F[M] = {3, 5, 17, 257, 65537};

int main(){
	long N;
	cin >> N;
	set<long> S;
	for(int mask = 0; mask < 1<<M; mask++){
		long x = 1;
		for(int i = 0; i < M; i++){
			if(mask >> i & 1){
				x *= F[i];
			}
		}
		while(x <= N){
			if(x >= 3){
				S.insert(x);
			}
			x *= 2;
		}
	}
	cout << S.size() << endl;
}