#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const ll mod = 1e9+7;

ll A;
ll F[10];
set<ll> s;
ll ans;
int main() {
    cin>>A;
    REP(i,0,5){
        F[i]=pow(2,pow(2,i))+1;
    }
    REP(i, 0, 1 << 5) {
        ll num = 1;
        REP(j, 0, 5) {
            if (i & (1 << j)) num*=F[j];
        }
        for (ll j = num; j <= A; j <<= 1) {
            if(3 <= j) ans++;
        }

    }

    p(ans);
    return 0;
}