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(_) for _ in input().split()][0]

e = [0] * (N + 1)

for i in range(2, N + 1):
    tmp = i
    for j in range(2, i + 1):
        if tmp <= 1: break
        while tmp % j == 0:
            e[j] += 1
            tmp //= j

dp = [[0] * 76 for _ in range(N + 1)]

dp[0][1] = 1
for i in range(1, N + 1):
    for j in range(e[i] + 1):  # i番目を j個使う
        for k in range(75 + 1):
            if k * (j + 1) > 75: break
            if dp[i - 1][k] > 0:
                dp[i][k * (j + 1)] += dp[i - 1][k]

# for i in range(len(dp)):
#     print(dp[i])
print(dp[N][75])
