#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <algorithm>
#include <cmath>

#include <string>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>

/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(6);//
	
	LL F[100];
	int Fmax=0;
	bool flag=true;
	LL temp;
	for(int i=0;flag==true;++i){
		temp = (LL)pow(2.0, pow(2.0,i*1.0) ) + 1;
		if(temp <= (int)1e9){
			F[i] = temp;
			++Fmax;
		}else{
			flag = false;
		}
	}//3 5 17 257 65537
	LL FC[32];
	FC[0] = 1;
	int FCmax = 1;
	for(int i=1;i<(1<<5);++i){
		FC[i] = 1;
		FC[i] *= (i&1)==1?F[0]:1;
		FC[i] *= ((i&2)>>1)==1?F[1]:1;
		FC[i] *= ((i&4)>>2)==1?F[2]:1;
		FC[i] *= ((i&8)>>3)==1?F[3]:1;
		FC[i] *= ((i&16)>>4)==1?F[4]:1;
		
		if(FC[i] > (int)1e9){
			FC[i] = -1;
		}else{
			++FCmax;
		}
	}
	sort(FC,FC+32,greater<LL>());

	LL N;
	cin >> N;
	LL ans=0;
	for(int i=0;i<FCmax;++i){
		int count = 0;
		while( N >= (FC[i]<<count) ){
			if( (FC[i]<<count) >= 3){
				++ans;
			}
			++count;
		}
	}
	P(ans);
    return 0;
}