#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>

using namespace std;

inline bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }

typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef long long ll;
typedef unsigned long long ull;

#define For(i,a,b)	for(int (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define sz(a)		(sizeof(a))
#define Fill(a,v)	fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)

const int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int mod = 1000000007;
const int INF = 1e9;

vector<int> f;
int a;
set<int> se;

void dfs(int n,int v){
	if (n == f.size()){
		if (v <= 0)return;
		
		rep(i, 1e9){
			int t = v;
			rep(j, i)t *= 2;

			if (t >= 3 && t <= a)se.insert(t);
			if (t > a)break;
		}
		
		return;
	}
	dfs(n + 1, v);
	dfs(n + 1, v * f[n]);
}

int main()
{
	for (int t = 1;t <= 32; t *= 2){
		int tf = 1;
		rep(i, t)tf *= 2;
		f.push_back(tf + 1);
	}
	cin >> a;
	dfs(0, 1);

	cout << se.size() << endl;

	return 0;
}