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]*(N+1)
for i in range(2, N+1):
    cur = i
    for j in range(2, i+1):
        while cur % j == 0:
            e[j] +=1
            cur //=j

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

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



