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

#define rep(i,x,y) for(ll i=(x);i<(y);i++)
#define rrep(i,x,y) for(ll i=(ll)(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
#ifdef LOCAL
#define dump(x)  cerr << #x << " = " << (x) << endl
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl
#define dassert(...) assert(__VA_ARGS__)
#else
#define dump(x)
#define debug(x)
#define dassert(...)
#endif
//#define int long long

typedef long long ll;
const ll MOD = 1e9 + 7;
const long double EPS = 1e-8;

long long modPow(long long a, long long x, long long p) {
    long long res = 1;
    while(x > 0) {
        if( x % 2 != 0) {
            res = (res * a) % p;
        }
        a = (a * a) % p;
        x /= 2;
    }
    return res;
}

long long modInverse(long long a, long long p) {
    //calculates the modular multiplicative of a mod m.
    //(assuming p is prime).
    return modPow(a, p-2, p);
}

long long modFactorial(long long a, long long p) {
    long long fact = 1;
    for (long long i=2; i<=a; i++) {
        fact *= i;
        fact %= p;
    }
    return fact;
}

struct combination {
    void preprocess(long long max_n, long long p) {
        factorials_ = vector<ll>(max_n+1, 1);
        inverse_factorials_ = vector<ll>(max_n+1, 1);
        for (long long i=1; i<max_n+1; i++) {
            factorials_[i] = factorials_[i-1] * i;
            factorials_[i] %= p;
        }
        inverse_factorials_[max_n] = modPow(factorials_[max_n],  p-2, p);
        for (long long i=max_n-1; i>=1; i--) {
            inverse_factorials_[i] = inverse_factorials_[i+1] * (i+1);
            inverse_factorials_[i] %= MOD;
        }

        _is_preprocessed = true;
    }

    long long combination_with_preprocessing(long long n, long long k, long long p) {
        if (!_is_preprocessed) assert(false);

        long long result = factorials_[n];
        result *= inverse_factorials_[k];
        result %= p;
        result *= inverse_factorials_[n-k];
        result %= p;
        return result;
    }

    static long long combination_without_preprocessing(long long n, long long k, long long p) {
        // calculates C(n,k) mod p (assuming p is prime).
        long long numerator = 1; // n * (n-1) * ... * (n-k+1)
        for (int i=0; i<k; i++) {
            numerator = (numerator * (n-i) ) % p;
        }

        long long denominator = 1; // k!
        for (int i=1; i<=k; i++) {
            denominator = (denominator * i) % p;
        }
        // numerator / denominator mod p.
        return ( numerator* modInverse(denominator,p) ) % p;
    }

private:
    vector<ll> factorials_, inverse_factorials_;
    bool _is_preprocessed = false;
};

void solve(long long N){
    vector<int> primes = {2};
    rep(i,3,N+1) {
        bool isPrime = true;
        for (const auto & prime : primes) {
            if (i % prime == 0) {
                isPrime = false;
                break;
            }
        }
        if (isPrime) primes.push_back(i);
    }

    unordered_map<int, int> count;
    rep(i,1,N+1) {
        int num = i;
        for (const auto & prime : primes) {
             while (num % prime == 0) {
                 num /= prime;
                 count[prime]++;
             }
        }
    }
    unordered_map<int, int> primesCnt;
    primesCnt[4] = 0;
    primesCnt[2] = 0;
    primesCnt[14] = 0;
    primesCnt[24] = 0;
    primesCnt[74] = 0;
    for (const auto& p : count) {
        for (const auto& pp : primesCnt)
        if (p.second >= pp.first) {
            primesCnt[pp.first]++;
        }
    }
    ll answer = 0;
    // 4, 4, 2(5 * 5 * 3)
    if (primesCnt[4] >= 2  && primesCnt[2] >= 3) {
        answer += combination::combination_without_preprocessing(primesCnt[4], 2, MOD) * (primesCnt[2] - 2);
    }
    // 24, 2(25 * 3)
    if (primesCnt[24] >= 1  && primesCnt[2] >= 2) {
        answer += primesCnt[24] * (primesCnt[2] - 1);
    }
    // 14, 4(15 * 5)
    if (primesCnt[14] >= 1  && primesCnt[4] >= 2) {
        answer += primesCnt[14] * (primesCnt[4] - 1);
    }
    // 74(75)
    if (primesCnt[74] >= 1) {
        answer += primesCnt[74];
    }
    cout << answer << endl;
}

signed main(){
    // ios_base::sync_with_stdio(false);
    // cin.tie(NULL);
    long long N;
    scanf("%lld",&N);
    solve(N);
    return 0;
}


Measured memory_bytes: 256