import std.algorithm, std.array, std.container, std.range, std.bitmanip;
import std.numeric, std.math, std.bigint, std.random, core.bitop;
import std.string, std.regex, std.conv, std.stdio, std.typecons;

const auto fpi = [3, 5, 17, 257, 65537];

void main()
{
  auto a = readln.chomp.to!int;

  auto r = 0;

  foreach (i; 0..(1 << fpi.length)) {
    long s = 1;
    foreach (j; 0..fpi.length)
      if (i.bitTest(j)) s *= fpi[j];

    for (; s <= a; s <<= 1)
      if (s >= 3) r += 1;
  }

  writeln(r);
}

template BitOp(T) {
  bool bitTest(T n, size_t i) { return (n & (1.to!T << i)) != 0; }
  T bitSet(T n, size_t i) { return n | (1.to!T << i); }
  T bitReset(T n, size_t i) { return n & ~(1.to!T << i); }
  T bitComp(T n, size_t i) { return n ^ (1.to!T << i); }
  int bsf(T n) { return core.bitop.bsf(n.to!ulong); }
  int bsr(T n) { return core.bitop.bsr(n.to!ulong); }
  int popcnt(T n) { return core.bitop.popcnt(n.to!ulong); }
}

mixin BitOp!(int);