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())
f = [0]*(n+1)
for i in range(2,n+1):
    a = i
    for j in range(2,i+1):
        while a % j == 0:
            f[j] += 1
            a //= j
def number(m):
    c = 0
    for i in range(n):
        if f[i] >= m - 1:
            c += 1
    return c
print(number(75) + number(25)*(number(3) - 1) + number(15)*(number(5) - 1) 
+ number(5)*(number(5) - 1)*(number(3) - 2)//2)
