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 = [1] * (N+1)
for i in range(2,N+1):
    j = 2
    while i >= j:
        if i%j == 0:
            p[j] += 1
            i //= j
        else:
            j += 1
    if i > 1:
        p[i] += 1
p.sort(reverse = True)

def num(x):
    i = 0
    while p[i] >= x:
        i += 1
    return i
print(num(75) + num(25)*(num(3)-1) + num(15) * (num(5)-1) + num(5) * (num(5)-1) * (num(3)-2)//2)