#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define lint long long
#define pii pair<int, int>
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORR(i, a, b) for(int i = (a); i > (b); --i)
#define REP(i, n) FOR(i, 0, n)
#define SZ(v) ((int)v.size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define FINF(a) memset(a, 0x3f, sizeof(a))
#define POW(n) (1LL << (n))
#define POPCNT(n) (__builtin_popcount(n))
#define IN(i, a, b) ((a) <= (i) && (i) <= (b))
using namespace std;
template <typename T> inline bool CHMIN(T& a,T b) { if(a > b) { a = b; return 1; } return 0; }
template <typename T> inline bool CHMAX(T& a,T b) { if(a < b) { a = b; return 1; } return 0; }
template <typename T> inline void SORT(T& a) { sort(begin(a), end(a)); }
template <typename T> inline void REV(T& a) { reverse(begin(a), end(a)); }
template <typename T> inline void UNI(T& a) { sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end()); }
template <typename S, typename T> inline T LB(S& v, T a) { return *lower_bound(begin(v), end(v), a); }
template <typename S, typename T> inline int LBP(S& v, T a) { return lower_bound(begin(v), end(v), a) - begin(v); }
template <typename S, typename T> inline T UB(S& v, T a) { return *upper_bound(begin(v), end(v), a); }
template <typename S, typename T> inline int UBP(S& v, T a) { return upper_bound(begin(v), end(v), a) - begin(v); }
template <typename S, typename T> ostream& operator << (ostream& os, const pair<S, T>& p) { os << p.first << " " << p.second; return os; }
template <typename S, typename T> istream& operator >> (istream& is, pair<S, T>& p) { is >> p.first >> p.second; return is; }
template <typename T> ostream& operator << (ostream& os, const vector<T>& v) { for (int i = 0; i < v.size(); ++i) { if (i) os << " "; os << v[i]; } return os; }
template <typename T> istream& operator >> (istream& is, vector<T>& v) { for(T& in : v) is >> in; return is; }
template <typename T = int> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...)); }
template <typename T, typename V> typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V> typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); }
const lint MOD = 1000000007;
const lint INF = 0x3f3f3f3f3f3f3f3f;
const double PI = 3.14159265358979323846;
const double EPS = 1e-10;

const int MAX_N = 100;
bool is_prime[MAX_N + 1];   // iが素数かどうか
int min_factor[MAX_N+ 1];   // iの最小の素因数
vector<int> primes;

void sieve(int n = MAX_N + 1) {
    fill(is_prime + 2, is_prime + n, true);
    min_factor[1] = 1;
    for (int i = 2; i < n; i++) {
        if (!is_prime[i]) continue;
        primes.push_back(i);
        min_factor[i] = i;
        for (int j = 2 * i; j < n; j += i) {
            is_prime[j] = false;
            if (min_factor[j] == 0) min_factor[j] = i;
        }
    }
}

// n!の素因数分解
map<int, int> prime_factor_factorial(const int n) {
    map<int, int> res;
    for (int p : primes) {
        if (p > n) break;
        int exp = 0, base = p;
        while (n / base) {
            exp += n / base;
            base *= p;
        }
        res[p] = exp;
    }
    return res;
}

int N;
int cnt[210];

void _main() {
    sieve();
    cin >> N;
    auto pf = prime_factor_factorial(N);
    int ans = 0;
    REP (i, SZ(primes)) if (pf[primes[i]] >= 74) {
        ans++;
    }
    REP (i, SZ(primes)) if (pf[primes[i]] >= 24) {
        REP (j, SZ(primes)) if (j != i && pf[primes[j]] >= 2) {
            ans++;
        }
    }
    REP (i, SZ(primes)) if (pf[primes[i]] >= 14) {
        REP (j, SZ(primes)) if (j != i && pf[primes[j]] >= 4) {
            ans++;
        }
    }
    REP (i, SZ(primes)) if (pf[primes[i]] >= 4) {
        FOR (j, i + 1, SZ(primes)) if (pf[primes[j]] >= 4) {
            REP (k, SZ(primes)) if (k != i && k != j && pf[primes[k]] >= 2) {
                ans++;
            }
        }
    }
    cout << ans << endl;
}
// 75 = 5 * 5 * 3
// 3, 5, 5
// 3, 25
// 15, 5
// 75
signed main(signed argc, char **argv) {
    if (argc > 1) {
        if (strchr(argv[1], 'i')) freopen("input.txt", "r", stdin);
        if (strchr(argv[1], 'o')) freopen("output.txt", "w", stdout);
    }
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
    _main();
    return 0;
}

Measured memory_bytes: 256