#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> GetPrime(int n) {
  vector<bool> mark(n + 1);
  vector<int> Prime;
  for (int i = 2; i <= n; ++i) {
    if (!mark[i]) {
      Prime.emplace_back(i);
    }
    for (int j = 0; j < Prime.size() && i * Prime[j] <= n; ++j) {
      mark[i * Prime[j]] = true;
      if (i % Prime[j] == 0) {
        break;
      }
    }
  }
  return Prime;
}
int main() {
	long long n;
	cin >> n;
	auto p = GetPrime(2000000);
	int m = p.size();
	int ans = 0;
	for (int i = 1; i < m; ++i) {
		ll mul = 1;
		for (int l = i - 1; l >= 0; --l) {
			if (n / p[l] < mul) {
				break;
			}
			mul *= p[l];
			if (mul <= n && (mul + 1) % p[i] == 0) {
				ll div = (mul + 1) / p[i];
				while (div % 2 == 0) {
					div /= 2;
				}
				if ((mul + 1) / p[i] > 1 && div == 1) {
					ans++;
					break;
				}
			}
		}
	}
	cout << ans << '\n';
}