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(){
    vector<bool>v(201);
    v[3*5*7]=1;
    v[3*5*11]=1;
    v[3*3*3*5]=1;
    v[3*3*3*7]=1;
    v[3*5*13]=1;
    int n;
    cin>>n;
    cout<<accumulate(v.begin(),v.begin()+1+n,0);
}