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>
using namespace std;
 
int main() {
  int N;cin>>N;
  int M=0;
  vector<int>V{105,135,165,189,195};
  for(int X=0;X<5;X++){
    if(N<V[X]){
      break;
    }
    else{
      M++;
    }
  }
  cout<<M<<endl;
}