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())
prime = [2,3,5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]


def yakusuu(n,p):
    res = 0
    while n > 0:
        n //= p
        res += n
    return res

l2 = 0
l4 = 0
l14 = 0
l24 = 0
l74 = 0

for p in prime:
    y = yakusuu(n,p)
    if y >= 2:
        l2 += 1
    if y >= 4:
        l4 += 1
    if y >= 14:
        l14 += 1
    if y >= 24:
        l24 += 1
    if y >= 74:
        l74 += 1

print(l4*(l4-1)*(l2-2)//2+l14*(l4-1)+l24*(l2-1)+l74)