#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;

int main()
{
    vector<ll> f_list, a;
    ll n, f[] = {3, 5, 17, 257, 65537}, p = 1;
    cin >> n;
    for (int i = 0; i < (1 << 5); i++)
    {
        p = 1;
        for (int j = 0; j < 5 && p < inf; j++)
        {
            if (i & (1 << j))
                p *= f[j];
            if (j == 4 && p < inf)
                f_list.push_back(p);
        }
    }
    ll pow2 = 1;
    for (int i = 0; i < 32; i++, pow2 *= 2)
    {
        for (auto can : f_list)
        {
            a.push_back(pow2 * can);
        }
    }
    sort(a.begin(), a.end());
    int ans = 0;
    for (int i = 0; i < a.size() && a[i] <= n; i++)
    {
        if (a[i] <= n && a[i] >= 3)
            ans++;
    }
    cout << ans << endl;
}