import java.util.ArrayList;
import java.util.List;

public class Euler268 {

    static List<Integer> primesBelow100() {
        int max_n = 100;
        boolean[] composite = new boolean[max_n + 1];
        List<Integer> primes = new ArrayList<>();
        for (int i = 2; i < max_n; i++) {
            if (!composite[i])
                primes.add(i);
            for (int p : primes) {
                int v = i * p;
                if (v >= max_n)
                    break;
                composite[v] = true;
                if (i % p == 0)
                    break;
            }
        }
        return primes;
    }

    static long binom(int n, int k) {
        if (k < 0 || k > n)
            return 0;
        if (k == 0 || k == n)
            return 1;
        long numer = 1;
        long denom = 1;
        for (int i = 1; i <= k; i++) {
            numer *= (n - k + i);
            denom *= i;
        }
        return numer / denom;
    }

    static long[] subsetSums;
    static long maxValue;
    static List<Integer> primes;

    static void dfs(int index, int taken, long product) {
        if (taken >= 4) {
            subsetSums[taken] += maxValue / product;
        }

        if (index >= primes.size())
            return;

        for (int i = index; i < primes.size(); i++) {
            long p = primes.get(i);
            if (product > maxValue / p)
                continue;
            dfs(i + 1, taken + 1, product * p);
        }
    }

    static long solveLimit(long limit) {
        if (limit <= 1)
            return 0;

        primes = primesBelow100();
        subsetSums = new long[26];
        maxValue = limit - 1;

        dfs(0, 0, 1L);

        long answer = 0;
        for (int k = 4; k <= primes.size(); k++) {
            long coeff = (((k - 4) % 2 == 0) ? 1 : -1) * binom(k - 1, 3);
            answer += coeff * subsetSums[k];
        }
        return answer;
    }

    public static void main(String[] args) {
        long ans = solveLimit(10000000000000000L);
        System.out.println(ans);
    }
}