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] * 101

for x in range(2, n + 1):
    d = 2
    while x > 1:
        c = 0
        while x % d == 0:
            x //= d
            c += 1
        e[d] += c
        d += 1


# 75
# 25 3
# 15 5
# 5 5 3

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


ans = f(75) + f(25) * (f(3) - 1) + f(15) * (f(5) - 1) + f(5) * (f(5) - 1) // 2 * (f(3) - 2)
print(ans)
