#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <string>
#include <set>

using namespace std;

typedef long long ll;

int main() {
  int a;
  cin >> a;
  ll memo[5] = {3, 5, 17, 257, 65537};
  set <ll> num;
  ll p = 1;
  ll cnt = 0;
  while (p <= a) {
    for (int i = 0; i < (1<<5); i++) {
      ll sum = p;
      for (int j = 0, k = i; j < 5; j++, k>>=1) {
	if (k&1) {
	  sum *= memo[j];
	}
	cnt++;
	if (sum > a) break;
      }
      if (sum >= 3 && sum <= a) num.insert(sum);
    }
    p<<=1;
  }

  std::cout << num.size() << std::endl;
}