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
import collections

n = int(input())

counts = collections.defaultdict(int)
for x in range(2, n + 1):
    for y in range(2, n + 1):
        while x % y == 0:
            counts[y] += 1
            x //= y

def f(a):
    return sum(1 for b in counts if counts[b] >= a - 1)

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