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

ulong MAX = 1_000_100, MOD = 1_000_000_007, INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias lread(T = long) = () => readln.chomp.to!(T);
alias aryread(T = long) = () => readln.split.to!(T[]);
alias Node = Tuple!(long, "p", long, "dist");
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);

void main()
{
    auto n = lread();
    long lim = 101; // 入力の制限より大きい最小の素数
    auto ary = new long[](lim);
    foreach (a; iota(1, n))
    {
        auto p_factor = prime_factorization(a + 1, lim);
        ary[] += p_factor[];
    }
    ary[] += 1;
    // ary.take(n).writeln();
    long gt_5, gt_3, gt_15, gt_25, gt_75;
    foreach (e; ary)
    {
        if (e >= 3)
            gt_3++;
        if (e >= 5)
            gt_5++;
        if (e >= 15)
            gt_15++;
        if (e >= 25)
            gt_25++;
        if (e >= 75)
            gt_75++;
    }
    long ans;
    ans += (gt_5 * (gt_5 - 1) / 2) * (gt_3 - 2);
    ans += (gt_15) * (gt_5 - 1);
    ans += (gt_25) * (gt_3 - 1);
    ans += (gt_75);
    ans.writeln();
}

auto prime_factorization(long a, long lim)
{
    auto p_factor = new long[](lim);
    foreach (i; iota(1, a))
    {
        while (a % (i + 1) == 0)
        {
            a /= (i + 1);
            p_factor[i]++;
        }
        if (a == 0)
            break;
    }
    return p_factor;
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}
