#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    // n = 2^m F1 F2, ..., Fk
    vector<ll> F = {3, 5, 17, 257, 65537};
    vector<ll> B;
    int sz = F.size();
    rep(S,1<<sz) {
        ll p = 1;
        rep(i,sz) if(S & (1 << i)) p *= F[i];
        while(p <= ll(1e9)) {
            B.push_back(p);
            p *= 2;
        }
    }

    sort(B.begin(), B.end());
    ll A; cin >> A;
    cout << upper_bound(B.begin(), B.end(), A) - B.begin() - 2 << endl;
}