#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

int main(){
  ll A;
  cin >> A;
  ll F[5] = {3, 5, 17, 257, 65537};
  int ans = 0;
  FOR (m,0,50) {
    ll x = pow(2, m);
    FOR (i,0,1<<5){
      ll y = x;
      FOR (j,0,5) {
        if((i>>j) & 1) {
          y *= F[j];
        }
      }
      if (y <= A && y >= 3) ans++;
    }
  }
  cout << ans << endl;
  return 0;
}