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, = map(int, raw_input().split())
p = {}
for i in range(2, N+1):
  ii = i
  for j in range(2, i+1):
    while(ii%j==0):
      p[j] = p.get(j, 0)+1
      ii //= j
m = [3,5,15,25,75]
x = {}
for l in m:
  x[l-1] = 0
for k in p:
  for l in m:
    if p[k]>=l-1:
      x[l-1] += 1
r = 0
if x[4]>=2 and x[2]-2>=1:
  r += x[4]*(x[4]-1)*(x[2]-2)//2
if x[14]>=1 and x[4]-1>=1:
  r += x[14]*(x[4]-1)
if x[24]>=1 and x[2]-1>=1:
  r += x[24]*(x[2]-1)
if x[74]>=1:
  r += x[74]
print r