#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    vector<ll> p = {2, 3, 5, 17, 257, 65537};
    vector<ll> num;
    ll lim = 1000000000;
    function<void(int,ll)> dfs = [&](int i, ll v){
        if(i == 6){
            if(v <= 2)return;
            num.push_back(v);
            return;
        }
        if(p[i] >= 3){
            dfs(i + 1, v);
            dfs(i + 1, v * p[i]);
            return;
        }
        while(v <= lim){
            dfs(i + 1, v);
            v *= p[i];
        }
    };
    dfs(0, 1);
    sort(num.begin(), num.end());
    ll n;
    cin >> n;
    cout << upper_bound(num.begin(), num.end(), n) - num.begin() << endl;
}