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

for i in range(2, n+1):
  tmp = i
  div = 2
  while(div <= i):
    if(tmp%div == 0):
      arr[div] += 1
      tmp //= div
    else:
      div += 1
    
def count(n):
  return len([i for i in arr if i >= n])

ans = count(74) + count(24)*(count(2)-1) + count(14)*(count(4)-1) + count(4)*(count(4)-1)*(count(2)-2)//2
print(ans)