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.Scanner;
import java.util.Arrays;
import java.util.ArrayList;
import java.util.List;
import java.util.Collections;

public class Main {
	public static void main(String args[]) throws InterruptedException {
		    Scanner sc = new Scanner(System.in);	
			
			int n = sc.nextInt();
			int[] natural = new int[101];
			int[] yakusu = new int[101];
			int ans = 0;
			int cnt74 = 0;
			int cnt24 = 0;
			int cnt14 = 0;
			int cnt5 = 0;
			int cnt4 = 0;
			int cnt2 = 0;

			for (int i = 0; i < 101; i++) {
				natural[i] = i;
			}
			for (int i = 1; i <= n; i++) {
				for (int j = 2; j <= i; j++) {
					while (natural[i] % j == 0) {
						natural[i] = natural[i]/j; 
						yakusu[j]++;
					}
					if (natural[i] == 1) {
						break;
					}
				}
			}
			//yakusu is gotten	
			//Now to choose
			for (int i = 0; i <= n; i++) {
				if (yakusu[i] >= 74) {
					cnt74++;
				}
				if (yakusu[i] >= 24) {
					cnt24++;
				}
				if (yakusu[i] >= 14) {
					cnt14++;
				}
				if (yakusu[i] >= 4) {
					cnt4++;
				}
				if (yakusu[i] >= 2) {
					cnt2++;
				}
			}
			ans = cnt74+
			cnt24*(cnt2-1)+
			cnt4*(cnt4-1)*(cnt2-2)/2 +
			cnt14*(cnt4-1);
			//75,3-5-5,3-25,5-15
			System.out.println(ans);
		    sc.close(); }

	public static boolean isEven(int n ) {
		if (n % 2 == 0) {
			return true;
		}else{
			return false;
		}
	}

	
}