The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?

Constraints

* N is an integer between 1 and 200 (inclusive).

Input

Input is given from Standard Input in the following format:


N


Output

Print the count.

Examples

Input

105


Output

1


Input

7


Output

0
#include <iostream>

int main() {
  uint32_t N = 0;
  std::cin >> N;
  const uint32_t ans[] = {105, 135, 165, 189, 195};
  uint32_t i = 0;
  for (; i < 5 && N >= ans[i]; i++) continue;
  std::cout << i << std::endl;

  return 0;
}