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 <bits/stdc++.h>

int main() {
  int d[] = {105, 135, 165, 189, 195};
  int n;
  std::cin >> n;
  int count = 0;
  for (const auto i : d) {
    if (i <= n) {
      count++;
    }
  }

  std::cout << count << std::endl;
  return 0;
}
