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
n = int(raw_input())
sieve = [True] * (n + 1)
for i in range(2, n+1):
    if sieve[i]:
        for j in range(i+i, n+1, i):
            sieve[j] = False

primes = [0] * (n+1)
for i in range(2, n+1):
    if sieve[i]:
        for j in range(i, n+1):
            j2 = j
            num = 0
            while j2 % i == 0:
                j2 /= i
                num += 1
            primes[i] += num
gt2 = 0
gt4 = 0
gt14 = 0
gt24 = 0
gt74 = 0
for i in range(2, n+1):
    if primes[i] >= 2:
        gt2 += 1
    if primes[i] >= 4:
        gt4 += 1
    if primes[i] >= 14:
        gt14 += 1
    if primes[i] >= 24:
        gt24 += 1
    if primes[i] >= 74:
        gt74 += 1
def nCk(n, k):
    numera = 1
    for i in range(n, n-k, -1):
        numera *= i
    denomi = 1
    for i in range(k, 0, -1):
        denomi *= i
    return numera / denomi
res = 0
res += gt14 * (gt4-1)
res += gt24 * (gt2-1)
res += gt74
res += nCk(gt4, 2)*(gt2-2)
print res