import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N = lread();
    auto f = new long[](N);
    foreach (x; 1 .. N + 1)
    {
        foreach (y; factorize(x))
            f[y]++;
    }
    auto dp = new long[][](N, 77);
    dp[0][1] = 1;
    foreach (i; 1 .. N)
    {
        foreach (j; 0 .. f[i] + 1)
        {
            foreach (k; 0 .. 77)
            {
                long cnt = k * (j + 1);
                dp[i][min(cnt, 76)] += dp[i - 1][k];
            }
        }
    }
    writeln(dp[$ - 1][75]);
}

/// 素因数分解
long[] factorize(long x)
{
    assert(0 < x, "x is negative");
    long[] result;
    while ((x & 1) == 0)
    {
        x /= 2;
        result ~= 2;
    }
    for (long i = 3; i * i <= x; i += 2)
        while (x % i == 0)
        {
            x /= i;
            result ~= i;
        }
    if (x != 1)
        result ~= x;
    return result;
}
