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

// ------------ Prime Factorization (Update 8/6) ------------ //
std::map<unsigned long long, unsigned> prime_factorize(unsigned long long x) {
	std::map<unsigned long long, unsigned> ret;
	for (unsigned i = 2; 1ULL * i * i <= x; i++) {
		while (x % i == 0) x /= i, ret[i]++;
	}
	if (x != 1) ret[x]++;
	return ret;
}

// ------------ Enumerate Divisors (Update 10/27) ------------ //
std::vector<unsigned long long> calc_divisors(unsigned long long x) {
	std::map<unsigned long long, unsigned> res = prime_factorize(x);
	std::vector<unsigned long long> ret; ret.push_back(1);
	for (std::pair<unsigned long long, unsigned> w : res) {
		int s = ret.size();
		unsigned long long mul = 1;
		for (int i = 0; i < w.second; i++) {
			mul *= w.first;
			for (int j = 0; j < s; j++) ret.push_back(ret[j] * mul);
		}
	}
	sort(ret.begin(), ret.end());
	return ret;
}

int x;
int main() {
	cin >> x;
	vector<unsigned long long> v = calc_divisors(2305843008676823040);
	int cnt = 0;
	for(unsigned long long i : v) if(i <= x) cnt++;
	cout << cnt - 2 << endl;
	return 0;
}