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

int main() {
    int a;cin>>a;
    
    int cnt=0;
    
    vector<int>F;
    F.push_back(1);
    
    int n=0;
    long long fn = pow(2,pow(2,n))+1;
    while(fn<=a){
        int Fsize=F.size();
        for(int i=0;i<Fsize;i++){
            if(F[i]*fn<=a)F.push_back(F[i]*fn);
            else break;
        }
        
        n++;
        fn = pow(2,pow(2,n))+1;
    }
    
    for(int i=0;i<F.size();i++){
        int num=F[i];
        while(num<=a){
            cnt++;
            num*=2;
        }
    }
    
    cout<<cnt-2<<endl;
    
    return 0;
}