#include <iostream>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <cstring>

using namespace std;

#define FOR(x,y) for(int x = 0;x < (y);x++)
#define LLI long long int
#define FORR(x,arr) for(auto& x:arr)
#define ALL(a) (a.begin()),(a.end())

#define _L(x) cout<<(x)<<endl
//#define _L(x) ;

template<int um> class UF {
public:
    vector<int> _parent,_rank;
    UF()
    {
        _parent=_rank=vector<int>(um,0);
        for(int i=0;i<um;i++)
        {
            _parent[i]=i;
        }
    }
    
    int Find(int x)
    {
        if(_parent[x] == x)
        {
            return x;
        }
        _parent[x] = Find(_parent[x]);
        return _parent[x];
    }
    
    int Union(int x,int y)
    {
        int xRoot = Find(x);
        int yRoot = Find(y);
        if(_rank[xRoot]>_rank[yRoot])
        {
            _parent[xRoot] = yRoot;
           return yRoot;
        }
        if(_rank[xRoot]<_rank[yRoot])
        {
            _parent[yRoot] = xRoot;
            return xRoot;
        }
        if(xRoot != yRoot)
        {
            _parent[yRoot] = xRoot;
            _rank[xRoot]++;
            return xRoot;
        }
        return xRoot;
    }
};

int dp[(1 << 16) + 1];

int main() {
    LLI a;
    cin >> a;
    LLI seeds[] = {3,5,17,257,65537};
    
    set<LLI> data;
    data.insert(1);
    for(int i = 0;i < 5;i++)
    {
        set<LLI> newData;
        for(auto ite = data.begin();ite != data.end();ite++)
        {
            newData.insert(*ite);
            newData.insert(*ite * seeds[i]);
        }
        data = newData;
    }
    data.erase(1);
    data.insert(4);
    {
        set<LLI> newData;
        for(auto ite = data.begin();ite != data.end();ite++)
        {
            auto next = *ite;
            while(true)
            {
                if(next <= a)
                {
                    newData.insert(next);
                }
                else
                {
                    break;
                }
                next *= 2;
            }
        }
        cout << newData.size() << endl;
        return 0;
    }
}