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())
e = [0 for _ in range(N + 1)]

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

c = tuple(filter(lambda x: x > 0, e))  # 素因数の指数

dp = [[0 for _ in range(75 + 1)] for _ in range(len(c) + 1)]  # dp[素因数のidx][約数の個数] = 条件を満たす個数
dp[0][1] = 1

i = 1
for cc in c:
    for j in range(1, 75 + 1):
        k = 0  # 指数のうち使う個数
        while j * (k + 1) <= 75 and k <= cc:
            dp[i][j * (k + 1)] += dp[i - 1][j]
            k += 1
    i += 1

# print(c)
print(dp[len(c)][75])
