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(){
  int n, c,a=0;
  std::cin>>n;
  for(int i=1;i<n+1;++i){if(i%2){c=0;for(int j=1;j<i+1;++j){(i%j?0:++c);}(c==8?++a:0);}}
  std::cout << a;
}
