#include <bits/stdc++.h>
#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
    #include <filesystem>
    namespace fs = std::filesystem;
#else
    #define DBG(X)
    #define SAY(X)
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 1,-1, 1,-1};
int dy[]={0, 1, 0, -1, 1, 1,-1,-1};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
static mt19937 _g(time(nullptr));
 
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const map<T, S> p) { for (auto el : p) cout << "[" << el.first << ";" << el.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

int N;
void input(){
    fast_io();
    #ifdef __LOCAL
        fs::path __p = __FILE__;
        fs::path __input, __output;
        __input = __output = __p.parent_path();
        __input += string("/input/") + string(__p.stem()) + string(".txt");
        __output += string("/output/") + string(__p.stem()) + string(".txt");
        freopen(__input.c_str(), "r", stdin);
        freopen(__output.c_str(), "w", stdout);
    #endif
    cin >> N;
}

unordered_map< int, int > prime_factor(int n) {
  unordered_map< int, int > ret;
  for(int i = 2; i * i <= n; i++) {
    while(n % i == 0) {
      ret[i]++;
      n /= i;
    }
  }
  if(n != 1) ret[n] = 1;
  return ret;
}

bool isok(int n){
    if(n==1) return true;
    if(n==3) return true;
    if(n==5) return true;
    if(n==15) return true;
    if(n==25) return true;
    if(n==75) return true;
    return false;
}

int solve(){
    unordered_map<int,int> pf_fact;
    for (int i = 1; i <= N; i++)
    {
        auto pf = prime_factor(i);
        for(auto p:pf) pf_fact[p.first]+=p.second;
    }
    map<int, int> cnt;
    for(auto &p:pf_fact){
        p.second++;
        while(!isok(p.second)) p.second--;
        cnt[p.second]++;
    }
    int ans=0;
    vector<ll> av={1};
    for(auto p:pf_fact){
        if(p.second==1) continue;
        else if(p.second==3) 
        {
            vector<ll> tmp;
            for(auto v:av) {
                // if(v%75==0) v=0;
                tmp.push_back(v);
                tmp.push_back(3*v);
                }
            av = tmp;
        }
        else if(p.second==5) 
        {
            vector<ll> tmp;
            for(auto v:av) {
                // if(v%75==0) v=0;
                tmp.push_back(v);
                tmp.push_back(3*v);
                tmp.push_back(5*v);
                }
            av = tmp;
        }
        else if(p.second==15) 
        {
            vector<ll> tmp;
            for(auto v:av) {
                // if(v%75==0) v=0;
                tmp.push_back(v);
                tmp.push_back(3*v);
                tmp.push_back(5*v);
                tmp.push_back(15*v);
                }
            av = tmp;
        }
        else if(p.second==25) 
        {
            vector<ll> tmp;
            for(auto v:av) {
                // if(v%75==0) v=0;
                tmp.push_back(v);
                tmp.push_back(3*v);
                tmp.push_back(5*v);
                tmp.push_back(15*v);
                tmp.push_back(25*v);
                }
            av = tmp;
        }
        else if(p.second==75)         
        {
            vector<ll> tmp;
            for(auto v:av) {
                // if(v%75==0) v=0;
                tmp.push_back(v);
                tmp.push_back(3*v);
                tmp.push_back(5*v);
                tmp.push_back(15*v);
                tmp.push_back(25*v);
                tmp.push_back(75*v);
                }
            av = tmp;
        }
    }
    DBG(av.size())
    for(auto v:av) if(v==75) ans++;
    cout << ans << endl;

    return 0;
}   

int main()
{
    input();
    solve();
    return 0;
}


Measured memory_bytes: 215692