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(void){
    int n;
    cin >> n;
    cout << ((n >= 195) ? 5 : (n >= 189) ? 4 : (n >= 165) ? 3 : (n >= 135) ? 2 : (n >= 105) ? 1 : 0) << "\n";
}
