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>
#include<algorithm>
using namespace std;
int main(void)
{ 
  int n,ans;
  cin>>n;
  ans=0;
  if(n>=105)ans++;
  if(n>=165)ans++;
  if(n>=195)ans++;
  if(n>=135){ans++;}
  if(n>=189){ans++;}
  cout<<ans;
  
}