#include <iostream>
#include <fstream>
#include <cmath>  
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string> 
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <random>

using namespace std;
using ll = long long;

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

#define REP(i,n) for(int i = 0; i < int(n); i++)
#define FOR(i, m, n) for(int i = int(m);i < int(n);i++)
#define ALL(obj) (obj).begin(),(obj).end()

const ll MOD = (ll)1e9 + 7;
const ll HINF = (ll)1e18;
const ll LINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;

template<class T> void corner(bool flg, T hoge) {
	if (flg) {
		cout << hoge << endl;
		exit(0);
	}
	else return;
}

template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {
	o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;
}

template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {
	o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;
}

template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {
	o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;
}

template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {
	o << "{" << obj.first << ", " << obj.second << "}"; return o;
}

template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {
	o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;
}

void print(void) {
	cout << endl;
}

template <class Head> void print(Head&& head) {
	cout << head;
	print();
}

template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {
	cout << head << " ";
	print(forward<Tail>(tail)...);
}

void YN(bool flg) {
	cout << ((flg) ? "YES" : "NO") << endl;
}

void Yn(bool flg) {
	cout << ((flg) ? "Yes" : "No") << endl;
}

void yn(bool flg) {
	cout << ((flg) ? "yes" : "no") << endl;
}

//Prime Factorization
vector<long long> PrimeFact(long long N) {
	vector<long long> ret;
	if (N == 1) ret.push_back(1);
	for (long long i = 2, M = N; i*i <= M; ++i) {
		if (N%i == 0) ret.push_back(i);
		while (N%i == 0) N /= i;
	}
	if (N != 1) ret.push_back(N);
	return ret;
}

//divisor 
set<long long> Divisor(long long N) {
	set<long long> ret;
	for (long long i = 1; i*i <= N; ++i) {
		if (N%i == 0) {
			ret.insert(i);
			ret.insert(N / i);
		}
	}
	return ret;
}

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

	map<int, ll> mp;
	FOR(i, 1, N+1) {
		int a = i;
		auto u = PrimeFact(a);
		for(auto t: u){
			if (t == 1) continue;
			int cnt = 0;
			while(a>0 && a%t==0){
				a /= t;
				cnt++;
			}
			mp[t] += cnt;
		}
	}
	V<ll> b;
	for (auto u : mp) b.push_back(u.second + 1);
	ll ans = 0;
	for(int i = 0; i < b.size(); ++i){
		if (b[i] >= 75) ans++;
	}
	for (int i = 0; i < b.size(); ++i) {
		for (int j = 0; j < b.size(); ++j) {
			if (i == j) continue;
			if (b[i] >= 25 && b[j] >=3) ans++;
		}
	}
	for (int i = 0; i < b.size(); ++i) {
		for (int j = 0; j < b.size(); ++j) {
			if (i == j) continue;
			if (b[i] >= 15 && b[j] >= 5) ans++;
		}
	}
	for (int i = 0; i < b.size(); ++i) {
		for (int j = 0; j < b.size(); ++j) {
			for (int k = j+1; k < b.size(); ++k) {
				if (i == j || j == k || k == i) continue;
				if (b[i] >= 3 && b[j] >= 5 && b[k] >= 5) ans++;
			}
		}
	}
	cout << ans << endl;
	return 0;
}



Measured memory_bytes: 256