#include <bits/stdc++.h>
using namespace std;
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repi(i,0,n)

const int fm[] = {3,5,17,257,65537};

typedef long long i64;
int n;
vector<int> xs;

int solve() {
    for (i64 a = 1; a <= n; a*=2)
    for (i64 b = 1; b <= 3; b*=3)
    for (i64 c = 1; c <= 5; c*=5)
    for (i64 d = 1; d <= 17; d*=17)
    for (i64 e = 1; e <= 257; e*=257)
    for (i64 f = 1; f <= 65537; f*=65537)
        if(a*b*c*d*e*f <= n) xs.push_back(a*b*c*d*e*f);
    sort(begin(xs),end(xs));
    xs.erase(unique(begin(xs),end(xs)),end(xs));
    return xs.size()-2;
}

int main() {
    scanf("%d", &n);
    cout << solve() << endl;
    return 0;
}