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
import java.util.Scanner;

class Main {
	public static void main(String[] args) {
	
		Scanner stdIn = new Scanner(System.in);
		
		int n = stdIn.nextInt();
		byte divisor;
		byte div8 = 0;
		
		if (n % 2 == 0) {
			n--;
		}
		
		for (; n > 0; n -=2) {
			
			divisor = 0;
		
		
			for (int i = 1; i <= n; i++ ) {
				if (n % i == 0) {
					divisor++;
				}
			}
			
			if (divisor == 8) {
				div8++;
			}
			
		}
		
		System.out.println(div8);
	
	}

}