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 n in range(2,N+1):
    i = 2
    while i <= n:
        while n % i == 0:
            n //= i
            if i not in d:
                d[i] = 0
            d[i] += 1
        i += 1

ans_d = {3:0,5:0,15:0,25:0,75:0}    

for p in d:
    for n in ans_d:    
        if d[p] >= n-1:
            ans_d[n] += 1

ans = ans_d[5]*(ans_d[5]-1)*(ans_d[3]-2)//2+ans_d[75]

for n1 in ans_d:
    for n2 in ans_d:
        if n1 < n2 and n1*n2 == 75:
            ans += ans_d[n2]*(ans_d[n1]-1)

print(ans)