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(input())
T = [1 for k in range(101)]

for M in range(2,N+1):
    k = 2
    while k*k <= M:
        if M%k == 0:
            M //= k
            T[k] += 1
        else:
            k += 1
    if M > 1:
        T[M] += 1

C = [0 for k in range(101)]
for k in range(101):
    if T[k] >= 3:
        C[3] += 1
    if T[k] >= 5:
        C[5] += 1
    if T[k] >= 15:
        C[15] += 1
    if T[k] >= 25:
        C[25] += 1
    if T[k] >= 75:
        C[75] += 1

print(C[75] + C[25]*(C[3]-1) + C[15]*(C[5]-1) + (C[5]*(C[5]-1)*(C[3]-2))//2)
