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

e = [0] * (n+1)


for i in range(2, n+1):
  num = i
  m = 2
  while m * m <= num:
    while num % m == 0:
      e[m] += 1
      num //= m
    m += 1
  if num > 1:
    e[num] += 1
    

num2 = num4 = num14 = num24 = num74 = 0    
for i in range(len(e)):
  if e[i] >= 2:
    num2 += 1
  if e[i] >= 4:
    num4 += 1
  
  if e[i] >= 14:
    num14 += 1
    
  if e[i] >= 24:
    num24 += 1
    
  if e[i] >= 74:
    num74 += 1
    
    
ans = num74 + (num24 * (num2-1)) + (num14 * (num4-1)) + (num4 * (num4-1) * (num2-2)//2)
print(ans)