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())

if n < 10:
    print(0)
    exit()

e = [0 for _ in range(n + 1)]

for i in range(2, n + 1):
    temp = i
    for j in range(2, i + 1):
        while temp % j == 0:
            e[j] += 1
            temp //= j

a = [0 for _ in range(75)]
for i in range(n + 1):
    for j in range(min(75, e[i] + 1)):
        a[j] += 1

ans = a[74] + a[24] * (a[2] - 1) + a[14] * (a[4] - 1) + a[4] * (a[4] - 1) * (a[2] - 2) // 2
print(ans)
