#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
	map<int, int> prime;
	for (int i = 2; i <= n; i++) {
		int t = i;
		for (auto it = prime.begin(); it != prime.end(); it++) {
			while (t % it->first == 0) {
				t /= it->first; it->second++;
			}
		}
		if (t == i) { prime[t]++; }
	}
	int ans = 0;
	int a[5] = {75, 25, 15, 5, 3};
	int count[5] = {0};
	for (auto it = prime.begin(); it != prime.end(); it++) {
		for (int i = 0; i < 5; i++) {
			if (it->second >= a[i]-1) {
				count[i]++;
			}
		}
	}
	ans += count[0]; // 75
	ans += count[1] * (count[4] - 1); // 25 * 3
	ans += count[2] * (count[3] - 1); // 15 * 5
	ans += count[3] * (count[3] - 1) / 2 * (count[4] - 2); // 5 * 5 * 3
	cout << ans << endl;
	return 0;
}