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;
 
public class Main {
 
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int answer = 0;
		for(int i = 3;i <=n;i+=2) {
			if(isYakusuEight(i)) {
				answer++;
			}
		}
		System.out.println(answer);
 
	}
 
	private static boolean isYakusuEight(int number) {
		int yakusu = 0;
		for(int i =1; i <=number;i++) {
			if(number % i ==0) {
				yakusu++;
			}
		}
 
		if(yakusu ==8) {
			return true;
		}
		return false;
	}
}