//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <limits>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

//math
//-------------------------------------------
template<class T> inline T sqr(T x) { return x * x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define EXISTch(s,c) ((((s).find_first_of(c)) != std::string::npos)? 1 : 0)//cがあれば1 if(1)
#define SORT(c) sort((c).begin(),(c).end())

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007;//10^9+7
const LL INF2 = (LL)100000000000000000;//10^18

vector<int> ret;

vector<int> prime_factor(int64_t n) {
	
	for (int64_t i = 2; i * i <= n; i++) {
		while (n % i == 0) {
			ret[i]++;
			n /= i;
		}
	}

	//素数は1回も割られないのでそのままでてくる
	if (n != 1) ret[n]++;
	return ret;
}

//for (auto p : prime_factor(N)) {
//	cout << p.first << " " << p.second << endl;
//}

//auto primes=primefactor(n);

int main() {

	int n; cin >> n;

	ret.resize(n + 1);

	for (int i = n; i >= 1; i--) {
		prime_factor(i);
	}

	LL ans = 0;
	//75
	for (int i = 2; i < n+1; i++) {
		if (ret[i] >= 74)ans++;
	}

	//3-25(2-24)

	for (int i = 2; i < n+1; i++) {
		if (ret[i] < 2)continue;
		for (int j = i+1; j < n+1; j++) {
			if (ret[j] >= 24)ans++;
		}
	}

	//5-15(4-14)

	for (int i = 2; i < n + 1; i++) {
		if (ret[i] < 4)continue;
		for (int j = i + 1; j < n + 1; j++) {
			if (ret[j] >= 14)ans++;
		}
	}

	//15-5(14-4)

	for (int i = 2; i < n + 1; i++) {
		if (ret[i] < 14)continue;
		for (int j = i + 1; j < n + 1; j++) {
			if (ret[j] >= 4)ans++;
		}
	}

	//25-3(24-2)

	for (int i = 2; i < n + 1; i++) {
		if (ret[i] < 24)continue;
		for (int j = i + 1; j < n + 1; j++) {
			if (ret[j] >= 2)ans++;
		}
	}

	//3-5-5(2-4-4)
	for (int i = 2; i < n+1; i++) {
		if (ret[i] < 2)continue;
		for (int j = i+1; j < n+1; j++) {
			if (ret[j] < 4)continue;
			for (int k = j+1; k < n+1; k++) {
				if (ret[k] >= 4)ans++;
			}
		}
	}

	for (int i = 2; i < n + 1; i++) {
		if (ret[i] < 4)continue;
		for (int j = i + 1; j < n + 1; j++) {
			if (ret[j] < 2)continue;
			for (int k = j + 1; k < n + 1; k++) {
				if (ret[k] >= 4)ans++;
			}
		}
	}

	for (int i = 2; i < n + 1; i++) {
		if (ret[i] < 4)continue;
		for (int j = i + 1; j < n + 1; j++) {
			if (ret[j] < 4)continue;
			for (int k = j + 1; k < n + 1; k++) {
				if (ret[k] >= 2)ans++;
			}
		}
	}

	cout << ans << endl;

	return 0;
}

Measured memory_bytes: 256