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>
using namespace std;
int main(){
  int N;
  cin>>N;
  int count=0;
  for(int x=1;x<=N;x+=2){
    int num=0;
    for(int y=1;y<=x;y++)
      if(x%y==0) num++;
    if(num==8) count++;
  }
  cout<<count<<endl;
  return 0;
}