import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author silviase
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B105 solver = new B105();
        solver.solve(1, in, out);
        out.close();
    }

    static class B105 {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int res = 0;
            for (int i = 1; i <= n; i++) {
                if (yakusu(i) == 8 && i % 2 == 1) res++;
            }
            out.println(res);
        }

        int yakusu(int x) {
            int res = 0;
            for (int i = 1; i <= x; i++) {
                if (x % i == 0) res++;
            }
            return res;
        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B105 solver = new B105();
        solver.solve(1, in, out);
        out.close();
    }

    static class B105 {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int res = 0;
            for (int i = 1; i <= n; i++) {
                if (yakusu(i) == 8 && i % 2 == 1) res++;
            }
            out.println(res);
        }

        int yakusu(int x) {
            int res = 0;
            for (int i = 1; i <= x; i++) {
                if (x % i == 0) res++;
            }
            return res;
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B105 solver = new B105();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B105 solver = new B105();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) B105 solver = new B105(); solver new B105() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class B105 {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int res = 0;
            for (int i = 1; i <= n; i++) {
                if (yakusu(i) == 8 && i % 2 == 1) res++;
            }
            out.println(res);
        }

        int yakusu(int x) {
            int res = 0;
            for (int i = 1; i <= x; i++) {
                if (x % i == 0) res++;
            }
            return res;
        }

    } B105 public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int res = 0;
            for (int i = 1; i <= n; i++) {
                if (yakusu(i) == 8 && i % 2 == 1) res++;
            }
            out.println(res);
        } solve {
            int n = in.nextInt();
            int res = 0;
            for (int i = 1; i <= n; i++) {
                if (yakusu(i) == 8 && i % 2 == 1) res++;
            }
            out.println(res);
        } int n = in.nextInt(); n in.nextInt() in.nextInt in int res = 0; res 0 for (int i = 1; i <= n; i++) {
                if (yakusu(i) == 8 && i % 2 == 1) res++;
            } int i = 1; int i = 1; i 1 i <= n i n i++ i++ i {
                if (yakusu(i) == 8 && i % 2 == 1) res++;
            } {
                if (yakusu(i) == 8 && i % 2 == 1) res++;
            } if (yakusu(i) == 8 && i % 2 == 1) res++; yakusu(i) == 8 && i % 2 == 1 yakusu(i) == 8 yakusu(i) yakusu i 8 i % 2 == 1 i % 2 i 2 1 res++ res out.println(res) out.println out res int testNumber testNumber Scanner in in PrintWriter out out int yakusu(int x) {
            int res = 0;
            for (int i = 1; i <= x; i++) {
                if (x % i == 0) res++;
            }
            return res;
        } yakusu {
            int res = 0;
            for (int i = 1; i <= x; i++) {
                if (x % i == 0) res++;
            }
            return res;
        } int res = 0; res 0 for (int i = 1; i <= x; i++) {
                if (x % i == 0) res++;
            } int i = 1; int i = 1; i 1 i <= x i x i++ i++ i {
                if (x % i == 0) res++;
            } {
                if (x % i == 0) res++;
            } if (x % i == 0) res++; x % i == 0 x % i x i 0 res++ res return res; res int x x public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B105 solver = new B105();
        solver.solve(1, in, out);
        out.close();
    }

    static class B105 {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int res = 0;
            for (int i = 1; i <= n; i++) {
                if (yakusu(i) == 8 && i % 2 == 1) res++;
            }
            out.println(res);
        }

        int yakusu(int x) {
            int res = 0;
            for (int i = 1; i <= x; i++) {
                if (x % i == 0) res++;
            }
            return res;
        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B105 solver = new B105();
        solver.solve(1, in, out);
        out.close();
    }

    static class B105 {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int res = 0;
            for (int i = 1; i <= n; i++) {
                if (yakusu(i) == 8 && i % 2 == 1) res++;
            }
            out.println(res);
        }

        int yakusu(int x) {
            int res = 0;
            for (int i = 1; i <= x; i++) {
                if (x % i == 0) res++;
            }
            return res;
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author silviase
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B105 solver = new B105();
        solver.solve(1, in, out);
        out.close();
    }

    static class B105 {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int res = 0;
            for (int i = 1; i <= n; i++) {
                if (yakusu(i) == 8 && i % 2 == 1) res++;
            }
            out.println(res);
        }

        int yakusu(int x) {
            int res = 0;
            for (int i = 1; i <= x; i++) {
                if (x % i == 0) res++;
            }
            return res;
        }

    }
}

