#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;



//呪文
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr;	} cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
#define PI 3.14159265358979323846
#define EPS 1e-6
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define all(x) (x).begin(), (x).end()



int yuki0237()
{
	ll A, ans = 0;
	cin >> A;

	// Fermat prime
	ll fp[5] = { 3, 5, 17, 257, 65537 };

	// 2^m 角形をカウント (m >= 2)
	for (ll n = 4; n <= A; n <<= 1) ans++;

	// 00001 ~ 11111 までの整数 i と fp の部分集合とを対応させる
	for (int i = 1; i < (1 << 5); i++) {

		// 相異なるフェルマー素数の積
		ll prod = 1;

		// i の 2^b 桁目にビットが立っていれば fp[b] を乗算
		// 例 : i = 01101 に対応する fp の部分集合は { 3, 17, 257 } で，その積は prod = 13107
		for (int b = 0; b < 5; b++)
			if (i & (1 << b)) 
				prod *= fp[b];

		// prod * 2^m 角形 (m = 0, 1, 2,...) をカウント
		for (ll n = prod; n <= A; n <<= 1) ans++;

	}

	cout << ans << endl;

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0237();
	
	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}