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

primes = [2,3,5,7] + [x for x in range(10,100) if (x%2 and x%3 and x%5 and x%7)]

def fact_ord(p,n):
  return n//p+fact_ord(p,n//p) if n else 0

N = int(input())

order = [fact_ord(p,N) for p in primes]

arr = [0]*80 # 約数の個数ごとにいくつあるか
arr[1] = 1

for e in order:
  temp = [0]*80
  for ee,j in itertools.product(range(e+1),range(80)):
    y = min((ee+1)*j,79)
    temp[y] += arr[j]
  arr = temp
  
answer = arr[75]
print(answer)