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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
 
public class Main {
 
    void solve() throws IOException {
        int N = ni();
        Sieve sieve = new Sieve(N+1);
        HashMap<Integer,Integer> d = new HashMap<>();
        for (int i = 2; i <= N; i++) {
            HashMap<Integer,Integer> fc = sieve.factorCount(i);
            for (Integer key : fc.keySet()) {
                d.putIfAbsent(key, 0);
                d.put(key,d.get(key)+fc.get(key));
            }
        }

        // System.out.println(d);
        int numge2 = 0;
        int numge4 = 0;
        int numge14 = 0;
        int numge24 = 0;
        int numge74 = 0;
        for (Integer val : d.values()) {
            if(val>=2) numge2++;
            if(val>=4) numge4++;
            if(val>=14) numge14++;
            if(val>=24) numge24++;
            if(val>=74) numge74++;
        }
        long ans = 0;
        ans += Math.max((numge2-2),0) * numge4*(numge4-1)/2;
        ans += Math.max((numge2-1),0) * numge24;
        ans += Math.max(numge4-1,0) * numge14;
        ans += numge74;
        out.println(ans);
    }
    class Sieve {
        private int n;
        private int[] f;
        public ArrayList<Integer> primes = new ArrayList<>();
        public Sieve(int N){
            this.n = N;
            this.f = new int[n+1];
            this.f[0] = -1; // 0 is not prime
            this.f[1] = -1; // 1 is not prime
            for (int i = 2; i <= N; i++) {
                if(f[i]!=0) continue;
                primes.add(i);
                f[i] = i;
                for (int j = i+i; j <=n; j+=i) {
                    if(f[j] == 0) f[j] = i;
                }
            }
        }
        public boolean isPrime(int i){
            return f[i] == i;
        }
        public ArrayList<Integer> factorList(int i){
            ArrayList<Integer> res = new ArrayList<>();
            while(i!=1){
                res.add(f[i]);
                i/=f[i];
            }
            return res;
        }
        public HashMap<Integer,Integer> factorCount(int i){
            HashMap<Integer,Integer> res = new HashMap<>();
            while(i!=1){
                res.putIfAbsent(f[i],0);
                res.put(f[i],res.get(f[i])+1);
                i /= f[i];
            }
            return res;
        }
    }
    final int mod = 1000000007;
    int mul(int x, int y){
        return (int)((x * 1L * y) % mod);
    }
    int add(int x, int y) {
        x += y;
        return x >= mod ? (x - mod) : x;
    }
    int sub(int x, int y){
        x = add(x,mod-y);
        return x >= mod ? (x - mod) : x;
    }
    String ns() throws IOException {
        while (!tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine(), " ");
        }
        return tok.nextToken();
    }
 
    int ni() throws IOException {
        return Integer.parseInt(ns());
    }
 
    long nl() throws IOException {
        return Long.parseLong(ns());
    }
 
    double nd() throws IOException {
        return Double.parseDouble(ns());
    }
 
    String[] nsa(int n) throws IOException {
        String[] res = new String[n];
        for (int i = 0; i < n; i++) {
            res[i] = ns();
        }
        return res;
    }
 
    int[] nia(int n) throws IOException {
        int[] res = new int[n];
        for (int i = 0; i < n; i++) {
            res[i] = ni();
        }
        return res;
    }
 
    long[] nla(int n) throws IOException {
        long[] res = new long[n];
        for (int i = 0; i < n; i++) {
            res[i] = nl();
        }
        return res;
    }
 
    static BufferedReader in;
    static PrintWriter out;
    static StringTokenizer tok;
 
    public static void main(String[] args) throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        tok = new StringTokenizer("");
        Main main = new Main();
        main.solve();
        out.close();
    }
}