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())
div_num = [0]*(N+1)
for i in range(2,N+1):
    cur = i
    for j in range(2,i+1):
        while cur % j == 0:
            div_num[j] += 1
            cur = cur // j
MAX_VALUE = 80
dp = [0]*(MAX_VALUE)
dp[1] = 1
for i in range(2,N+1):
    for j in range(MAX_VALUE-1,-1,-1):
        for k in range(1,div_num[i]+1):
            next_ = j * (k+1)
            if next_ >= MAX_VALUE:
                break
            dp[next_] += dp[j]
print(dp[75])