You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many Shichi-Go numbers (literally "Seven-Five numbers") are there?

Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Constraints

* 1 \leq N \leq 100
* N is an integer.

Input

Input is given from Standard Input in the following format:


N


Output

Print the number of the Shichi-Go numbers that are divisors of N!.

Examples

Input

9


Output

0


Input

10


Output

1


Input

100


Output

543
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.UncheckedIOException;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

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

    static class D756 {
        public void solve(int testNumber, LightScanner in, PrintWriter out) {
            int n = in.ints();
            int[] primes = new int[]{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
            int[] factors = new int[primes.length];
            for (int i = 0; i < primes.length; i++) {
                for (int j = 2; j <= n; j++) {
                    int t = j;
                    while (t % primes[i] == 0) {
                        t /= primes[i];
                        factors[i]++;
                    }
                }
            }

            long ans = 0;

            // 75=5*5*3
            for (int x = 0; x < primes.length; x++) {
                if (factors[x] < 4) {
                    continue;
                }
                for (int y = 0; y < x; y++) {
                    if (factors[y] < 4) {
                        continue;
                    }
                    for (int z = 0; z < primes.length; z++) {
                        if (factors[z] < 2 || x == z || y == z) {
                            continue;
                        }
                        ans++;
                    }
                }
            }

            // 75=25*3
            for (int x = 0; x < primes.length; x++) {
                if (factors[x] < 24) {
                    continue;
                }
                for (int y = 0; y < primes.length; y++) {
                    if (factors[y] < 2 || x == y) {
                        continue;
                    }
                    ans++;
                }
            }

            // 75=15*5
            for (int x = 0; x < primes.length; x++) {
                if (factors[x] < 14) {
                    continue;
                }
                for (int y = 0; y < primes.length; y++) {
                    if (factors[y] < 4 || x == y) {
                        continue;
                    }
                    ans++;
                }
            }

            // 75=75
            if (factors[0] >= 74) {
                ans++;
            }

            //System.out.println(Arrays.toString(factors));
            out.println(ans);
        }

    }

    static class LightScanner {
        private BufferedReader reader = null;
        private StringTokenizer tokenizer = null;

        public LightScanner(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
        }

        public String string() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new UncheckedIOException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int ints() {
            return Integer.parseInt(string());
        }

    }
}

