#include <bits/stdc++.h>
#include <algorithm>
#include <string>
using namespace std;
int main(){
	int N;  
	cin >> N; 
	int A[114] = {}; 
	for(int i = 2; i <= N; i++){
                int k = i; 
		for(int j = 2; j <= N; j++){
			while(k % j == 0){
				A[j] ++; 
				k /= j; 
			}
		}
	}
	sort(A, A+100); 
	int N74 = 100 - (lower_bound(A, A+100, 74) - A); 
	int N24 = 100 - (lower_bound(A, A+100, 24) - A); 
	int N14 = 100 - (lower_bound(A, A+100, 14) - A); 
	int N4 = 100 - (lower_bound(A, A+100, 4) - A); 
	int N2 = 100 - (lower_bound(A, A+100, 2) - A); 
	int typeA = N74; 
	int typeB = N24 * (N2 - 1); 
	int typeC = (N4 * (N4 - 1))/2 * (N2 - 2); 
	int typeD = N14 * (N4 - 1); 
	cout << typeA + typeB + typeC + typeD << endl; 
}