#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

vector<int> fs{2, 3, 5, 17, 257, 65537};

int A;

int rec(int idx, ll v){
    if(idx == fs.size()){
        return 1;
    }

    int res = 0;    
    if(idx == 0){
        ll w = v;
        while(w <= A){
            res += rec(idx + 1, w);

            if(w * 2 > A){
                break;
            }

            w *= 2;
        }        
    }else{
        res = rec(idx + 1, v);
        if(v <= A / fs[idx]){
            res += rec(idx + 1, v * fs[idx]);
        }
    }

    return res;
}

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> A;
    
    std::cout << (rec(0, 1ll) - 2) << std::endl;
}