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 targetNum = 1; targetNum <= n; targetNum++) {
			int divisorCount = 0;
			if (targetNum % 2 == 0) {
				continue;
			}
			for (int i = 1; i <= targetNum; i++) {
				if (targetNum % i == 0) {
					divisorCount++;
				}
			}
			if (divisorCount == 8) {
				answer++;
			}
		}

		System.out.println(answer);

		sc.close();
	}
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz