#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int num[5] {3,5,17,257,65537};
int a;

int solve(ll n, int i) {
    int v = log(a/(n*num[i])*2+1) / log(2);
    if (i == 4)
        return v;
    else
        return v + solve(n*num[i],i+1) + solve(n,i+1);
}

int main() {
    int i, ans;
    cin >> a;
    ans = log(a/4*2+1) / log(2);
    ans += solve(1,0);
    cout << ans << endl;
    return 0;
}