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 ans=0;
 for(int i=1;i<=n;i+=2){
  int p=0;
  for(int j=1;j<=i;j+=2){
   if(i%j==0)p++;
  }
  if(p==8)ans++;
 }
 cout<<ans<<endl;
}
