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())
d = {}
for i in range(2, n+1):
    for j in range(2, i+1):
        while i%j == 0:
            i //= j
            d[j] = d.get(j, 0)+1
a = list(d.values())
dp = [[0]*74 + [1] for i in range(len(a)+1)]
for i in reversed(range(len(a))):
    for j in range(74):
        for k in range(a[i]+1):
            v = j+(j+1)*k
            if v > 74:
                break
            dp[i][j] += dp[i+1][v]
print(dp[0][0])