#include <iostream>
#include <set>
#include <math.h>
using namespace std;
long long int fs[5]={3,5,17,257,65537};
long long int n;
std::set<long long int> sets;

void dfs(int deep,long long int m){
	if(n<m)return ;
	
	if(m>2)sets.insert(m);
	if(deep==5)return ;
	dfs(deep+1,m*fs[deep]);
	dfs(deep+1,m);
}

int main() {
	std::cin>>n;
	for(long long int i=1;i<=n;i*=2){
		if(i>2)sets.insert(i);
		dfs(0,i);
	}
	std::cout<<sets.size()<<"\n";
	return 0;
}