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())

p = [0] * (N+1)

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

def get_sum(n): return len(list(filter(lambda x: x >= n-1, p)))

print(get_sum(75) + get_sum(25)*(get_sum(3)-1) + get_sum(15)*(get_sum(5)-1)
    + get_sum(5)*(get_sum(5)-1)*(get_sum(3)-2)//2)