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 itertools
N = int(input())
e = [0]*(N+1)
for i in range(2,N+1):
  cur = i
  for j in range(2,i+1):
    while cur%j==0:
      e[j] += 1
      cur = cur//j

ans = 0
for x in e :
  if x>=74:
    ans +=1
for (x, y) in itertools.combinations(e, 2):
  for a, b in [(24, 2), (14, 4), (4, 14), (2, 24)]:
    if x >= a and y >= b:
      ans += 1
for (x, y, z) in itertools.combinations(e, 3):
  for a, b, c in [[4, 4, 2], [4, 2, 4], [2, 4, 4]]:
    if x >= a and y >= b and z >= c:
      ans += 1
print(ans)