
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans = 0;
		for(int i = 1; i < n + 1; i++) {
			if(i % 2 == 1) {
				int tmp = i;
				int[] div = new int[n + 1];
				for(int j = 1; j < n + 1; j++) {
					div[j] = 0;
				}
				while(tmp != 1) {
					for(int j = 2; j < tmp + 1; j++) {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					}
				}
				int count = 1;
				for(int j = 2; j < n + 1; j++) {
					count *= div[j] + 1;
				}
				if(count == 8) {
					ans++;
				}
			}
		}
		System.out.println(ans);

	}

} import java.util.Scanner; Scanner java.util public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans = 0;
		for(int i = 1; i < n + 1; i++) {
			if(i % 2 == 1) {
				int tmp = i;
				int[] div = new int[n + 1];
				for(int j = 1; j < n + 1; j++) {
					div[j] = 0;
				}
				while(tmp != 1) {
					for(int j = 2; j < tmp + 1; j++) {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					}
				}
				int count = 1;
				for(int j = 2; j < n + 1; j++) {
					count *= div[j] + 1;
				}
				if(count == 8) {
					ans++;
				}
			}
		}
		System.out.println(ans);

	}

} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans = 0;
		for(int i = 1; i < n + 1; i++) {
			if(i % 2 == 1) {
				int tmp = i;
				int[] div = new int[n + 1];
				for(int j = 1; j < n + 1; j++) {
					div[j] = 0;
				}
				while(tmp != 1) {
					for(int j = 2; j < tmp + 1; j++) {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					}
				}
				int count = 1;
				for(int j = 2; j < n + 1; j++) {
					count *= div[j] + 1;
				}
				if(count == 8) {
					ans++;
				}
			}
		}
		System.out.println(ans);

	} main {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans = 0;
		for(int i = 1; i < n + 1; i++) {
			if(i % 2 == 1) {
				int tmp = i;
				int[] div = new int[n + 1];
				for(int j = 1; j < n + 1; j++) {
					div[j] = 0;
				}
				while(tmp != 1) {
					for(int j = 2; j < tmp + 1; j++) {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					}
				}
				int count = 1;
				for(int j = 2; j < n + 1; j++) {
					count *= div[j] + 1;
				}
				if(count == 8) {
					ans++;
				}
			}
		}
		System.out.println(ans);

	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int ans = 0; ans 0 for(int i = 1; i < n + 1; i++) {
			if(i % 2 == 1) {
				int tmp = i;
				int[] div = new int[n + 1];
				for(int j = 1; j < n + 1; j++) {
					div[j] = 0;
				}
				while(tmp != 1) {
					for(int j = 2; j < tmp + 1; j++) {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					}
				}
				int count = 1;
				for(int j = 2; j < n + 1; j++) {
					count *= div[j] + 1;
				}
				if(count == 8) {
					ans++;
				}
			}
		} int i = 1; int i = 1; i 1 i < n + 1 i n + 1 n 1 i++ i++ i {
			if(i % 2 == 1) {
				int tmp = i;
				int[] div = new int[n + 1];
				for(int j = 1; j < n + 1; j++) {
					div[j] = 0;
				}
				while(tmp != 1) {
					for(int j = 2; j < tmp + 1; j++) {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					}
				}
				int count = 1;
				for(int j = 2; j < n + 1; j++) {
					count *= div[j] + 1;
				}
				if(count == 8) {
					ans++;
				}
			}
		} {
			if(i % 2 == 1) {
				int tmp = i;
				int[] div = new int[n + 1];
				for(int j = 1; j < n + 1; j++) {
					div[j] = 0;
				}
				while(tmp != 1) {
					for(int j = 2; j < tmp + 1; j++) {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					}
				}
				int count = 1;
				for(int j = 2; j < n + 1; j++) {
					count *= div[j] + 1;
				}
				if(count == 8) {
					ans++;
				}
			}
		} if(i % 2 == 1) {
				int tmp = i;
				int[] div = new int[n + 1];
				for(int j = 1; j < n + 1; j++) {
					div[j] = 0;
				}
				while(tmp != 1) {
					for(int j = 2; j < tmp + 1; j++) {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					}
				}
				int count = 1;
				for(int j = 2; j < n + 1; j++) {
					count *= div[j] + 1;
				}
				if(count == 8) {
					ans++;
				}
			} i % 2 == 1 i % 2 i 2 1 {
				int tmp = i;
				int[] div = new int[n + 1];
				for(int j = 1; j < n + 1; j++) {
					div[j] = 0;
				}
				while(tmp != 1) {
					for(int j = 2; j < tmp + 1; j++) {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					}
				}
				int count = 1;
				for(int j = 2; j < n + 1; j++) {
					count *= div[j] + 1;
				}
				if(count == 8) {
					ans++;
				}
			} int tmp = i; tmp i int[] div = new int[n + 1]; div new int[n + 1] n + 1 n 1 for(int j = 1; j < n + 1; j++) {
					div[j] = 0;
				} int j = 1; int j = 1; j 1 j < n + 1 j n + 1 n 1 j++ j++ j {
					div[j] = 0;
				} {
					div[j] = 0;
				} div[j] = 0 div[j] div j 0 while(tmp != 1) {
					for(int j = 2; j < tmp + 1; j++) {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					}
				} tmp != 1 tmp 1 {
					for(int j = 2; j < tmp + 1; j++) {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					}
				} for(int j = 2; j < tmp + 1; j++) {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					} int j = 2; int j = 2; j 2 j < tmp + 1 j tmp + 1 tmp 1 j++ j++ j {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					} {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					} if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						} tmp % j == 0 tmp % j tmp j 0 {
							div[j]++;
							tmp /= j;
							break;
						} div[j]++ div[j] div j tmp /= j tmp j break; int count = 1; count 1 for(int j = 2; j < n + 1; j++) {
					count *= div[j] + 1;
				} int j = 2; int j = 2; j 2 j < n + 1 j n + 1 n 1 j++ j++ j {
					count *= div[j] + 1;
				} {
					count *= div[j] + 1;
				} count *= div[j] + 1 count div[j] + 1 div[j] div j 1 if(count == 8) {
					ans++;
				} count == 8 count 8 {
					ans++;
				} ans++ ans System.out.println(ans) System.out.println System.out System System.out ans String[] args args public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans = 0;
		for(int i = 1; i < n + 1; i++) {
			if(i % 2 == 1) {
				int tmp = i;
				int[] div = new int[n + 1];
				for(int j = 1; j < n + 1; j++) {
					div[j] = 0;
				}
				while(tmp != 1) {
					for(int j = 2; j < tmp + 1; j++) {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					}
				}
				int count = 1;
				for(int j = 2; j < n + 1; j++) {
					count *= div[j] + 1;
				}
				if(count == 8) {
					ans++;
				}
			}
		}
		System.out.println(ans);

	}

} public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans = 0;
		for(int i = 1; i < n + 1; i++) {
			if(i % 2 == 1) {
				int tmp = i;
				int[] div = new int[n + 1];
				for(int j = 1; j < n + 1; j++) {
					div[j] = 0;
				}
				while(tmp != 1) {
					for(int j = 2; j < tmp + 1; j++) {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					}
				}
				int count = 1;
				for(int j = 2; j < n + 1; j++) {
					count *= div[j] + 1;
				}
				if(count == 8) {
					ans++;
				}
			}
		}
		System.out.println(ans);

	}

} Main

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int ans = 0;
		for(int i = 1; i < n + 1; i++) {
			if(i % 2 == 1) {
				int tmp = i;
				int[] div = new int[n + 1];
				for(int j = 1; j < n + 1; j++) {
					div[j] = 0;
				}
				while(tmp != 1) {
					for(int j = 2; j < tmp + 1; j++) {
						if(tmp % j == 0) {
							div[j]++;
							tmp /= j;
							break;
						}
					}
				}
				int count = 1;
				for(int j = 2; j < n + 1; j++) {
					count *= div[j] + 1;
				}
				if(count == 8) {
					ans++;
				}
			}
		}
		System.out.println(ans);

	}

}
