import java.util.*;
import java.util.ArrayList;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int count=0;
        for (int i=1;i<n+1;i++){
            if (search(i)==8&&i%2==1){
                count++;
            }
        }
        System.out.println(count);
    }
    public static long search(long num){
        ArrayList<Long> ff = new ArrayList<Long>();
        for (long i = 2; i <= num; i++) {
            if (num % i == 0) {
                num /= i;
                ff.add(i);
                i = 1;
            }
        }
        ArrayList<Long> dd = new ArrayList<Long>();
        dd = (ArrayList<Long>) ff.clone();
        ArrayList<Long> ee = new ArrayList<Long>(new LinkedHashSet<>(dd));
        long[] d = new long[ee.size()];
        for (long g:d){
            g = 0;
        }
        for (int i = 0;i < ee.size();i++){
            for (long k:dd){
                if (ee.get(i) == k){
                    d[i]++;
                }
            }
        }
        long ans = 1;
        for (int i = 0;i < d.length;i++){
            ans = ans * (d[i]+1);
        }
        return ans;
    }
}
/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