fun main(args : Array<String>) {
    val N = readLine()!!.toInt()
    var primeFactors = hashMapOf<Int, Long>()

    // O(N^1.5)
    (1..N).forEach {
        var n = it
        (2..(Math.sqrt(it.toDouble()).toInt())).forEach {
            while (n % it == 0) {
                if (primeFactors.contains(it)) {
                    primeFactors[it] = primeFactors[it]!! + 1
                } else {
                    primeFactors[it] = 1
                }
                n /= it
            }
        }

        if (n != 1) {
            if (primeFactors.contains(n)) {
                primeFactors[n] = primeFactors[n]!! + 1
            } else {
                primeFactors[n] = 1
            }
        }
    }

    var factorsOver75Size = 0L
    var factorsOver25Size = 0L
    var factorsOver15Size = 0L
    var factorsOver5Size = 0L
    var factorsOver3Size = 0L

    primeFactors.entries.forEach {
        val size = it.value
        if (size >= 75 - 1) {
            factorsOver75Size++
        }
        if (size >= 25 -1) {
            factorsOver25Size++
        }
        if (size >= 15 -1) {
            factorsOver15Size++
        }
        if (size >= 5 -1) {
            factorsOver5Size++
        }
        if (size >= 3 -1) {
            factorsOver3Size++
        }
    }

    val answer = factorsOver75Size + factorsOver25Size * (factorsOver3Size - 1) + factorsOver15Size * (factorsOver5Size -1)+     (factorsOver5Size * (factorsOver5Size -1) / 2) * (factorsOver3Size-2)
    println(answer)
}