#include <bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;

int main(){
    int cnt = 0, a;
    cin >> a;
    vector<int> fp{3, 5, 17, 257, 65537};
    set<int> poly;
    for (int i = 0; i < 31; i++){
        for (int j = 0; j < (1 << 5); j++){
            int tmp = pow(2, i)*(max(1, fp[0]*(bool)(j & 1)))*(max(1, fp[1]*(bool)(j & (1 << 1))))*(max(1, fp[2]*(bool)(j & (1 << 2))))*(max(1, fp[3]*(bool)(j & (1 << 3))))*(max(1, fp[4]*(bool)(j & (1 << 4))));
            if (tmp <= a && tmp >= 3) poly.insert(tmp);
        }
    }
    cout << poly.size() << endl;
}