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;

public class Main {
	private static long[] a;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();

		a = new long[n + 1];
		long answer = 0;
		for (int i = 2; i <= n; i++) {
			int t = i;
			for (int j = 2; j <= t; j++) {
				while (t % j == 0) {
					a[j]++;
					t /= j;
				}
			}
		}
		answer += count(74);
		answer += count(24) * (count(2) - 1);
		answer += count(14) * (count(4) - 1);
		answer += count(4) * (count(4) - 1) * (count(2) - 2) / 2;

		System.out.println(answer);
	}

	private static long count(int n) {
		long answer = 0;
		for (int i = 2; i < a.length; i++) {
			if (a[i] >= n) answer++;
		}

		return answer;
	}
}
