You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many Shichi-Go numbers (literally "Seven-Five numbers") are there?

Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Constraints

* 1 \leq N \leq 100
* N is an integer.

Input

Input is given from Standard Input in the following format:


N


Output

Print the number of the Shichi-Go numbers that are divisors of N!.

Examples

Input

9


Output

0


Input

10


Output

1


Input

100


Output

543
#!/usr/bin/env python
# -*- coding: utf-8 -*-

# AtCoder Beginner Contest 114：D - 756


def factorize(n):
    fct = []  # prime factor
    b, e = 2, 0  # base, exponent
    while b * b <= n:
        while n % b == 0:
            n = n // b
            e = e + 1
        if e > 0:
            fct.append((b, e))
        b, e = b + 1, 0
    if n > 1:
        fct.append((n, 1))
    return fct


def divisorize(fct):
    b, e = fct.pop()  # base, exponent
    pre_div = divisorize(fct) if fct else [[]]
    suf_div = [[(b, k)] for k in range(e + 1)]
    return [pre + suf for pre in pre_div for suf in suf_div]


def ncm(n, m):
    if n<m:
        return 0
    a = 1
    for i in range(m):
        a *= (n-i)
    for i in range(m):
        a /= (m-i)
    return a


def main():
    N = int(raw_input().strip())

    # f = [[], []]
    f = []
    for i in range(2, N+1):
        f.append(factorize(i))
    # print f

    ff = [0]*100
    # print ff
    for fp in f:
        for fpp in fp:
            ff[fpp[0]] += fpp[1]
    # print ff

    '''
      5, 4, 3, 0, 5, 2, 4
    a *  *        *     * >= 4
    b *  *  *     *  *  * >= 2
    '''
    # (4+1) * (4+1) * (2+1) = 75
    # aC2 * (b-2)
    a = 0
    b = 0
    for fn in ff:
        if fn >= 4:
            a += 1
        if fn >= 2:
            b += 1
    n1 = ncm(a, 2) * (b-2)

    # (24+1)*(2+1) = 75
    # a * (b-1)
    a = 0
    b = 0
    for fn in ff:
        if fn >= 24:
            a += 1
        if fn >= 2:
            b += 1
    n2 = a * (b-1)

    # (14+1)*(4+1) = 75
    # a * (b-1)
    a = 0
    b = 0
    for fn in ff:
        if fn >= 14:
            a += 1
        if fn >= 4:
            b += 1
    n3 = a * (b-1)

    # (74+1) = 75
    # a
    a = 0
    for fn in ff:
        if fn >= 74:
            a += 1
    n4 = a

    print n1+n2+n3+n4


if __name__ == '__main__':
    main()
