#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int main() {
	set<int> ss;
	ll f[5] = {3, 5, 17, 257, 65537};
	
	REP(s, 1<<5) {
		ll num = 1;
		REP(i, 5) if (s >> i & 1) num *= f[i];
		
		if (num > 1e9) continue;
		
		REP(i, 32) {
			if (num * (1<<i) > 1e9) break;
			ss.insert(num * (1<<i));
		}
	}
	
	int n;
	cin >> n;
	
	int ans = 0;
	for (set<int>::iterator it = ss.begin(); it != ss.end(); ++it) {
		if (*it >= 3 && *it <= n) ans++;
	}
	
	cout << ans << endl;
	
	return 0;
}