#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/
vector<ll> prime(ll n){
    vector<ll> primes;
    vector<bool> p(n+1,true);
    p[0] = p[1] = false;
    for(ll i=2;i<=n;i++){
        if(!p[i]) continue;
        if(p[i]) primes.push_back(i);
        for(ll j=2;i*j<=n;j++) p[i*j]=false;
    }
    return primes;
}

vector<ll> primes = prime(100);

vector<ll> factor(primes.size(),0);

int main(){
    ll N; cin >> N;

    for(int i=1;i<=N;i++){
        int n = i;

        for(int j=0;j<primes.size();j++){
            int p = primes[j];
            while(n%p==0){
                n/=p;
                factor[j]++;
            }
        }
    }

    ll ans = 0;
    for(int i=0;i<primes.size();i++){
        if(factor[i]<2) continue;
        for(int j=0;j<primes.size();j++){
            if(i==j) continue;
            if(factor[j]<4) continue;
            for(int k=j+1;k<primes.size();k++){
                if(i==k) continue;
                if(factor[k]<4) continue;
                ans++;
            }
        }
    }

    for(int i=0;i<primes.size();i++){
        if(factor[i]<2) continue;
        for(int j=0;j<primes.size();j++){
            if(i==j) continue;
            if(factor[j]<24) continue;
            ans++;
        }
    }

    for(int i=0;i<primes.size();i++){
        if(factor[i]<4) continue;
        for(int j=0;j<primes.size();j++){
            if(i==j) continue;
            if(factor[j]<14) continue;
            ans++;
        }
    }

    for(int i=0;i<primes.size();i++){
        if(factor[i]<74) continue;
        ans++;
    }
    cout << ans << endl;
}


Measured memory_bytes: 256