#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>

using namespace std;
typedef long long LL;

int main(){
    vector<int> f;
    int v = 2;
    for(int n = 1; n < 6; n++){
        f.push_back(v+1);
        v *= v;
    }
    int N;
    cin >> N;
    LL ans = -2;
    for(int i = 0; i < (1<< 5); i++){
        LL base = 1;
        for(int j = 0; j < 5; j++){
            if(i&(1<<j)) base *= f[j];
        }
        while(base <= N){
            ans++;
            base += base;
        }
    }
    cout << ans << endl;
}