#include <bits/stdc++.h>
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
#define invrep(i,n) for(int64_t i=n-1;i >= 0;i--)
using namespace std;

//////全探索したいときに開けよ////////
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;

void setfspattern_core(int floor,int number,int degree){
  if(floor==degree){
    fspattern.at(fspcnt) = fspattern_draft;
    fspcnt++;
  }else{
    rep(i,number){
      fspattern_draft.at(floor) = i;
      setfspattern_core(floor+1,number,degree);
    }
  }
}

void setfspattern(int number,int degree){
  fspcnt = 0;
  int64_t array_num = 1;
  rep(i,degree){
    array_num *= number;
  }
  fspattern = vector<vector<int>>(array_num,vector<int>(degree));
  fspattern_draft = vector<int>(degree);
  setfspattern_core(0,number,degree);
}

//////nCrのmodを求めたいときに開けよ/////////
//int64_t univMod = 1000000007;
//int64_t factnum = 100000
//vector<int64_t> modfact(factnum);
//vector<int64_t> modinvfact(factnum);

/*void setmodfact(){
  for(int i=0;i<factnum;i++){
    if(i == 0){
      modfact.at(i) = 1;
    }else{
      modfact.at(i) = (modfact.at(i-1)*i)%univMod;
    }
  }
}

int64_t calcmodpower(int64_t a,int64_t n){
  int64_t res = 1;
  while(n != 0){
    if(n & 1){
      res = (res * a) % univMod;
    }
    a = (a*a) % univMod;
    n = n >> 1;
  }
  return res;
}

int64_t calcinverse(int64_t n){
	return calcmodpower(n,univMod-2);
}

void setmodinvfact(){
  for(int i=0;i<factnum;i++){
    if(i==0){
      modinvfact.at(i) = 1;
    }else{
      modinvfact.at(i) = calcmodpower(modfact.at(i),univMod-2);
    }
  }
}*/


/*
int64_t calcGCD(int64_t a,int64_t b){
	int64_t p = a;
	int64_t q = b;
	int64_t c = a%b;
	while(c != 0){
		p = q;
		q = c;
		c = p%q;
	}
	return q;
}
*/

int main(){
  int n;
  cin >> n;
  vector<int64_t> primes
    ={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
  vector<int64_t> primenum(25);
  for(int i=2;i<=n;i++){
    int k=i;
    rep(j,25){
      while(k % primes.at(j) == 0){
        k = k / primes.at(j);
        primenum.at(j)++;
      }
    }
  }
  /*rep(i,25){
    cout << primenum.at(i) << ",";
  }
  cout << endl;*/
  int64_t cnt = 0;
  rep(j,25){
    if(primenum.at(j) >= 74){
      cnt++;
    }
  }
  //cout << cnt << endl;
  for(int i=0;i < 25;i++){
    for(int j=i+1;j < 25;j++){
      if(primenum.at(i) >= 14 && primenum.at(j) >= 4){
        cnt++;
      }
      if(primenum.at(i) >= 4 && primenum.at(j) >= 14){
        cnt++;
      }
    }
  }
  //cout << cnt << endl;
  for(int i=0;i < 25;i++){
    for(int j=i+1;j < 25;j++){
      if(primenum.at(i) >= 24 && primenum.at(j) >= 2){
        cnt++;
      }
      if(primenum.at(i) >= 2 && primenum.at(j) >= 24){
        cnt++;
      }
    }
  }
  //cout << cnt << endl;
  for(int i=0;i < 25;i++){
    for(int j = i+1;j < 25;j++){
      for(int k = j+1;k < 25;k++){
        if(primenum.at(i) >= 2 && primenum.at(j) >= 4 && primenum.at(k) >= 4){
          cnt++;
        }
        if(primenum.at(i) >= 4 && primenum.at(j) >= 2 && primenum.at(k) >= 4){
          cnt++;
        }
        if(primenum.at(i) >= 4 && primenum.at(j) >= 4 && primenum.at(k) >= 2){
          cnt++;
        }
      }
    }
  }
  cout << cnt << endl;
        
        
  
}

Measured memory_bytes: 256