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())

d = dict()

for n in range(2, N+1):
    x = 2
    while n > 1:
        if n % x == 0:
            n //= x
            if x in d.keys():
                d[x] += 1
            else:
                d[x] = 1
        else:
            x += 1

# 75 = 3 * 5 * 5
# 75, 3 25, 5 15, 3 5 5 => 74, 2 24, 4 14, 2 4 4


def f(x):
    n = 0
    for i in d.values():
        if i >= x:
            n += 1
    return n


ans = f(74) + f(24) * (f(2) - 1) + f(14) * (f(4) - 1) \
      + ((f(4) * (f(4) - 1)) // 2) * (f(2) - 2)

print(ans)
