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
from sys import stdin

N = int(stdin.readline().rstrip())
A = [0] * 100

for n in range(1, N + 1):
    i = 2
    while n > 1:
        if n % i == 0:
            n //= i
            A[i] += 1
        else:
            i += 1

x = len([x for x in A if x >= 4])
y = len([x for x in A if x >= 2])
z = len([x for x in A if x >= 14])
w = len([x for x in A if x >= 4])
a = len([x for x in A if x >= 24])
b = len([x for x in A if x >= 2])

print(((x * (x - 1)) // 2) * (y - 2) + z * (w - 1) + a * (b - 1) + len([x for x in A if x >= 74]))
