#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>
#include<functional>
using namespace std;


#define input_init stringstream ss; string strtoken, token; istringstream is
#define input_line  getline(cin, strtoken);is.str(strtoken);is.clear(istringstream::goodbit)
#define input_token(num) ss.str(""); ss.clear(stringstream::goodbit); getline(is, token, ','); ss << token; ss >> num
typedef  long long LL;

const LL num[] = {3, 5, 17, 257, 65537};
int main(void){
	LL a;
	cin >> a;
	set<LL> memo;
	for (int i =0; i < 5; i++){
		LL tmp =num[i];
		for (int j = i; j < 5; j++){
			if (i != j)tmp *= num[j];
			for (int k = j; k < 5; k++){
				if (k != j)tmp *= num[k];
				for (int l = k; l < 5; l++){
					if (k != l)tmp *= num[l];
					for (int t = l; t < 5; t++){
						if (t != l)tmp *= num[t];
						memo.insert(tmp);
						if (t != l)tmp /= num[t];
					}
					if (k != l)tmp /= num[l];
				}
				if (k != j)tmp /= num[k];
			}
			if (i != j)tmp /= num[j];
		}
	}
	memo.insert(4);
	set<LL> res;
	for (auto& i : memo){
		LL tmp = i;
		while (tmp <= a){
			res.insert(tmp);
			tmp <<= 1;
		}
	}
	cout << res.size() << endl;
	return(0);
}