import java.util.*;

public class Main {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        List<Integer> primes = primeList(200);

        int N = scanner.nextInt();

        int[] nums = new int[201];

        for(int i=1; i<=200; i++){
            for(int j=1; j<=i; j++){
                if(i%j == 0){
                    nums[i]++;
                }
            }
        }

        int cnt = 0;
        for(int i=1; i<=N; i+=2){
            if(nums[i] == 8){
                cnt++;
            }
        }

        System.out.println(cnt);


    }

    static List<Integer> primeList(int n) {
        List<Integer> list = new ArrayList<>();
        boolean[] prime = new boolean[n + 1];
        Arrays.fill(prime, true);
        prime[0] = false;
        prime[1] = false;
        for (int i = 2; i < Math.sqrt(n); i++) {
            if (!prime[i]) continue;
            for (int j = 2; i * j <= n; j++) {
                prime[i * j] = false;
            }
        }
        for (int i = 0; i < prime.length; i++) {
            if (prime[i]) list.add(i);
        }

        return list;
    }
} import java.util.*; util.* java public class Main {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        List<Integer> primes = primeList(200);

        int N = scanner.nextInt();

        int[] nums = new int[201];

        for(int i=1; i<=200; i++){
            for(int j=1; j<=i; j++){
                if(i%j == 0){
                    nums[i]++;
                }
            }
        }

        int cnt = 0;
        for(int i=1; i<=N; i+=2){
            if(nums[i] == 8){
                cnt++;
            }
        }

        System.out.println(cnt);


    }

    static List<Integer> primeList(int n) {
        List<Integer> list = new ArrayList<>();
        boolean[] prime = new boolean[n + 1];
        Arrays.fill(prime, true);
        prime[0] = false;
        prime[1] = false;
        for (int i = 2; i < Math.sqrt(n); i++) {
            if (!prime[i]) continue;
            for (int j = 2; i * j <= n; j++) {
                prime[i * j] = false;
            }
        }
        for (int i = 0; i < prime.length; i++) {
            if (prime[i]) list.add(i);
        }

        return list;
    }
} Main public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        List<Integer> primes = primeList(200);

        int N = scanner.nextInt();

        int[] nums = new int[201];

        for(int i=1; i<=200; i++){
            for(int j=1; j<=i; j++){
                if(i%j == 0){
                    nums[i]++;
                }
            }
        }

        int cnt = 0;
        for(int i=1; i<=N; i+=2){
            if(nums[i] == 8){
                cnt++;
            }
        }

        System.out.println(cnt);


    } main {

        Scanner scanner = new Scanner(System.in);

        List<Integer> primes = primeList(200);

        int N = scanner.nextInt();

        int[] nums = new int[201];

        for(int i=1; i<=200; i++){
            for(int j=1; j<=i; j++){
                if(i%j == 0){
                    nums[i]++;
                }
            }
        }

        int cnt = 0;
        for(int i=1; i<=N; i+=2){
            if(nums[i] == 8){
                cnt++;
            }
        }

        System.out.println(cnt);


    } Scanner scanner = new Scanner(System.in); scanner new Scanner(System.in) List<Integer> primes = primeList(200); primes primeList(200) primeList 200 int N = scanner.nextInt(); N scanner.nextInt() scanner.nextInt scanner int[] nums = new int[201]; nums new int[201] 201 for(int i=1; i<=200; i++){
            for(int j=1; j<=i; j++){
                if(i%j == 0){
                    nums[i]++;
                }
            }
        } int i=1; int i=1; i 1 i<=200 i 200 i++ i++ i {
            for(int j=1; j<=i; j++){
                if(i%j == 0){
                    nums[i]++;
                }
            }
        } {
            for(int j=1; j<=i; j++){
                if(i%j == 0){
                    nums[i]++;
                }
            }
        } for(int j=1; j<=i; j++){
                if(i%j == 0){
                    nums[i]++;
                }
            } int j=1; int j=1; j 1 j<=i j i j++ j++ j {
                if(i%j == 0){
                    nums[i]++;
                }
            } {
                if(i%j == 0){
                    nums[i]++;
                }
            } if(i%j == 0){
                    nums[i]++;
                } i%j == 0 i%j i j 0 {
                    nums[i]++;
                } nums[i]++ nums[i] nums i int cnt = 0; cnt 0 for(int i=1; i<=N; i+=2){
            if(nums[i] == 8){
                cnt++;
            }
        } int i=1; int i=1; i 1 i<=N i N i+=2 i+=2 i 2 {
            if(nums[i] == 8){
                cnt++;
            }
        } {
            if(nums[i] == 8){
                cnt++;
            }
        } if(nums[i] == 8){
                cnt++;
            } nums[i] == 8 nums[i] nums i 8 {
                cnt++;
            } cnt++ cnt System.out.println(cnt) System.out.println System.out System System.out cnt String[] args args static List<Integer> primeList(int n) {
        List<Integer> list = new ArrayList<>();
        boolean[] prime = new boolean[n + 1];
        Arrays.fill(prime, true);
        prime[0] = false;
        prime[1] = false;
        for (int i = 2; i < Math.sqrt(n); i++) {
            if (!prime[i]) continue;
            for (int j = 2; i * j <= n; j++) {
                prime[i * j] = false;
            }
        }
        for (int i = 0; i < prime.length; i++) {
            if (prime[i]) list.add(i);
        }

        return list;
    } primeList {
        List<Integer> list = new ArrayList<>();
        boolean[] prime = new boolean[n + 1];
        Arrays.fill(prime, true);
        prime[0] = false;
        prime[1] = false;
        for (int i = 2; i < Math.sqrt(n); i++) {
            if (!prime[i]) continue;
            for (int j = 2; i * j <= n; j++) {
                prime[i * j] = false;
            }
        }
        for (int i = 0; i < prime.length; i++) {
            if (prime[i]) list.add(i);
        }

        return list;
    } List<Integer> list = new ArrayList<>(); list new ArrayList<>() boolean[] prime = new boolean[n + 1]; prime new boolean[n + 1] n + 1 n 1 Arrays.fill(prime, true) Arrays.fill Arrays prime true prime[0] = false prime[0] prime 0 false prime[1] = false prime[1] prime 1 false for (int i = 2; i < Math.sqrt(n); i++) {
            if (!prime[i]) continue;
            for (int j = 2; i * j <= n; j++) {
                prime[i * j] = false;
            }
        } int i = 2; int i = 2; i 2 i < Math.sqrt(n) i Math.sqrt(n) Math.sqrt Math n i++ i++ i {
            if (!prime[i]) continue;
            for (int j = 2; i * j <= n; j++) {
                prime[i * j] = false;
            }
        } {
            if (!prime[i]) continue;
            for (int j = 2; i * j <= n; j++) {
                prime[i * j] = false;
            }
        } if (!prime[i]) continue; !prime[i] prime[i] prime i continue; for (int j = 2; i * j <= n; j++) {
                prime[i * j] = false;
            } int j = 2; int j = 2; j 2 i * j <= n i * j i j n j++ j++ j {
                prime[i * j] = false;
            } {
                prime[i * j] = false;
            } prime[i * j] = false prime[i * j] prime i * j i j false for (int i = 0; i < prime.length; i++) {
            if (prime[i]) list.add(i);
        } int i = 0; int i = 0; i 0 i < prime.length i prime.length prime prime.length i++ i++ i {
            if (prime[i]) list.add(i);
        } {
            if (prime[i]) list.add(i);
        } if (prime[i]) list.add(i); prime[i] prime i list.add(i) list.add list i return list; list int n n public class Main {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        List<Integer> primes = primeList(200);

        int N = scanner.nextInt();

        int[] nums = new int[201];

        for(int i=1; i<=200; i++){
            for(int j=1; j<=i; j++){
                if(i%j == 0){
                    nums[i]++;
                }
            }
        }

        int cnt = 0;
        for(int i=1; i<=N; i+=2){
            if(nums[i] == 8){
                cnt++;
            }
        }

        System.out.println(cnt);


    }

    static List<Integer> primeList(int n) {
        List<Integer> list = new ArrayList<>();
        boolean[] prime = new boolean[n + 1];
        Arrays.fill(prime, true);
        prime[0] = false;
        prime[1] = false;
        for (int i = 2; i < Math.sqrt(n); i++) {
            if (!prime[i]) continue;
            for (int j = 2; i * j <= n; j++) {
                prime[i * j] = false;
            }
        }
        for (int i = 0; i < prime.length; i++) {
            if (prime[i]) list.add(i);
        }

        return list;
    }
} public class Main {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        List<Integer> primes = primeList(200);

        int N = scanner.nextInt();

        int[] nums = new int[201];

        for(int i=1; i<=200; i++){
            for(int j=1; j<=i; j++){
                if(i%j == 0){
                    nums[i]++;
                }
            }
        }

        int cnt = 0;
        for(int i=1; i<=N; i+=2){
            if(nums[i] == 8){
                cnt++;
            }
        }

        System.out.println(cnt);


    }

    static List<Integer> primeList(int n) {
        List<Integer> list = new ArrayList<>();
        boolean[] prime = new boolean[n + 1];
        Arrays.fill(prime, true);
        prime[0] = false;
        prime[1] = false;
        for (int i = 2; i < Math.sqrt(n); i++) {
            if (!prime[i]) continue;
            for (int j = 2; i * j <= n; j++) {
                prime[i * j] = false;
            }
        }
        for (int i = 0; i < prime.length; i++) {
            if (prime[i]) list.add(i);
        }

        return list;
    }
} Main
import java.util.*;

public class Main {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        List<Integer> primes = primeList(200);

        int N = scanner.nextInt();

        int[] nums = new int[201];

        for(int i=1; i<=200; i++){
            for(int j=1; j<=i; j++){
                if(i%j == 0){
                    nums[i]++;
                }
            }
        }

        int cnt = 0;
        for(int i=1; i<=N; i+=2){
            if(nums[i] == 8){
                cnt++;
            }
        }

        System.out.println(cnt);


    }

    static List<Integer> primeList(int n) {
        List<Integer> list = new ArrayList<>();
        boolean[] prime = new boolean[n + 1];
        Arrays.fill(prime, true);
        prime[0] = false;
        prime[1] = false;
        for (int i = 2; i < Math.sqrt(n); i++) {
            if (!prime[i]) continue;
            for (int j = 2; i * j <= n; j++) {
                prime[i * j] = false;
            }
        }
        for (int i = 0; i < prime.length; i++) {
            if (prime[i]) list.add(i);
        }

        return list;
    }
}
