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())
p = [0] * (N+1)


def is_prime(n):
    for i in range(2, n):
        if not n % i:
            return False
    return True


def n(m):
    return sum([True for i in p if i >= m])


l = [i for i in range(2, N+1) if is_prime(i)]
for i in range(2, N+1):
    for j in l:
        while not i % j:
            p[j] += 1
            i //= j

print(n(74) +
      (n(2)-1) * n(24) +
      (n(2)-2) * ((n(4)-1) * n(4))//2 +
      (n(4)-1) * n(14))