#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#include <bitset>
#include <complex>
#define rep(x, to) for (int x = 0; x < (to); x++)
#define REP(x, a, to) for (int x = (a); x < (to); x++)
#define foreach(itr, x) for (typeof((x).begin()) itr = (x).begin(); itr != (x).end(); itr++)
#define EPS (1e-14)

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef complex<double> Complex;
typedef vector< vector<int> > Mat;

ll A;
int p[5] = {3,5,17,257,65537};
ll ans;


ll count(ll x) {
	ll res = 0;
	while (x < 3) x *= 2;
	while (x <= A) {
		res++;
		x *= 2;
	}
	return res;
}

void dfs(int i, ll x) {
	if (i < 5) {
		dfs(i + 1, x);
		dfs(i + 1, x * p[i]);
	} else {
		ans += count(x);
		//cout << x << " : " << ans << endl;
	}
}

int main() {
	cin >> A;
	dfs(0, 1);
	cout << ans << endl;
	return 0;
}