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
from collections import defaultdict

n = int(input())
x = defaultdict(int)
for i in range(2, n + 1):
    k = i
    for j in range(2, i + 1):
        while(k % j == 0):
            k = k // j
            x[j] += 1

y = defaultdict(int)
for i in x.values():
    for j in [2, 4, 14, 24, 74]:
        if i >= j:
            y[j] += 1

ans = 0
ans += y[4] * max(0, y[4] - 1) * max(0, y[2] - 2) // 2
ans += y[14] * max(0, y[4] - 1)
ans += y[24] * max(0, y[2] - 1)
ans += y[74]
print(ans)
