#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;

int count(int n, vector<int>e){
    int cnt = 0;
    for(int i = 0; i < e.size(); i++){
        if(e[i] >= n - 1)cnt++;
    }
    return cnt;
}

int main(){
    int n;
    cin >> n;
    vector<int> e(n+1, 0);

    for(int i = 2; i <= n; i++){
        int tmp = i;
        for(int j = 2; j <= i; j++){
            while(tmp % j == 0){
                e[j]++;
                tmp /= j;
            }
        }
    }
    int ans = count(75, e) + count(25, e) * (count(3, e) - 1) + count(15, e) * (count(5, e) - 1) + count(5, e) * (count(5, e) - 1) * (count(3, e) - 2) / 2;
    cout << ans << endl;
    return 0;
}