#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}

class Combi {
    private:
      v(ll) fac, inv, finv;
      void init(int N) {
        fac[0] = fac[1] = 1; inv[1] = 1; finv[0] = finv[1] = 1;
        for (int i = 2; i < N; i++) {
          fac[i] = fac[i - 1] * i % MOD;
          inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
          finv[i] = finv[i - 1] * inv[i] % MOD;
        }
      }
    public:
      Combi(int N) : fac(N + 1), inv(N + 1), finv(N + 1) { init(N + 1); }
      ll Cmod(int n, int k) {
        if (n < k) return 0;
        if (n < 0 || k < 0) return 0;
        return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
      }
      ll Pmod(int n, int k) {
        if (n < k) return 0;
        if (n < 0 || k < 0) return 0;
        return fac[n] * finv[n - k] % MOD;
      }
};



vector<pair<int, int>> Pfact(int num) {
    vector<pair<int, int>> res;
    for (int i = 2; i * i <= num; i++) {
        int cnt = 0;
        while (num % i == 0) {
            cnt++;
            num /= i;
        }
        if (cnt) res.emplace_back(i, cnt);
    }
    if (num != 1) res.emplace_back(make_pair(num, 1));
    return res;
}
  
int main() {
  int N;
  cin >> N;
  map<int,int> insu;
  for(int k = 1;k <= N;k++) {
    vector<pair<int, int>> res = Pfact(k);
    
    rep(i,sz(res)) {
      insu[res[i].first] += res[i].second;
    }
  }
  vi num;
  for(auto i : insu) {
    num.push_back(i.second);
  }
  int num3 = 0,num5 = 0,num15 = 0,num25 = 0,num75 = 0;
  rep(i,sz(num)) {
    int x = num[i];
    if(x >= 3 - 1) {
      num3++;
      if(x >= 5 - 1) {
        num5++;
        if(x >= 15 - 1) {
          num15++;
          if(x >= 25 - 1){
            num25++;
            if(x >= 75 - 1) {
              num75++;
            }
          }
        }
      }
    }
  }
  Combi c = Combi(30);
  int ans = num75 + (num25 * (num3-1)) + num15 * (num5 - 1) + c.Cmod(num5,2) * (num3  - 2);

  cout << ans << endl;
  
  return 0;
}

Measured memory_bytes: 256