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.util.HashMap;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long k = sc.nextLong();
		HashMap<Long, Long> map = new HashMap<>();
		for(long n2 = 1 ; n2 <= k ; n2++) {
			long n = n2;
		for(long i = 2 ; i <= Math.sqrt(n) ; i++) {
			if(n % i != 0)
				continue;
			n /= i;
			map.put(i, map.getOrDefault(i,  0L) + 1L);
			if(n == 1)
				break;
          i--;
		}
      if(n != 1) {
        map.put(n, map.getOrDefault(n,  0L) + 1L);
        }
      }
      int num74 = 0;
      int num24 = 0;
      int num14 = 0;
      int num4 = 0;
      int num2 = 0;

      for(long l : map.keySet()) {
    	 long num = map.get(l);
    	 if(num >= 74) {
    		 num74++;
    	 }
    	 else if(num >= 24) {
    		 num24++;
    	 }
    	 else if(num >= 14) {
    		 num14++;
    	 }
    	 else if(num >= 4) {
    		 num4++;
    	 }
    	 else if(num >= 2) {
    		 num2++;
    	 }
  	    }
      int count = 0;
      count += num74; //75
      if(num2 + num4 + num14 + num24 + num74 >= 2)
      count += (num2 + num4 + num14 + num24 + num74 - 1) * (num24 + num74); // 3 * 25
      if(num2 + num4 + num14 + num24 + num74 >= 3 && num4 + num14 + num24 + num74 >= 2)
      count += (num2 + num4 + num14 + num24 + num74 - 2) * (num4 + num14 + num24 + num74) * (num4 + num14 + num24 + num74 - 1) / 2; // 3 * 5 * 5
      if(num4 + num14 + num24 + num74 >= 2)
      count += (num4 + num14 + num24 + num74 - 1) * (num14 + num24 + num74); // 5 * 15
      System.out.println(count);
	}
	public static long pow(long ml, long a, long b){
    if(b == 1)
      return ml;
      ml *= a;
      b--;
		return b == 0 ? ml : pow(ml , a ,b);
	}
}

