n=int(eval(input()))

m=[0]*101

for i in range(1,n+1):

  for j in range(2,n+1):

    while i%j==0:

      a=i//j

      while (a+1)*j<=i:

        a+=1

      i=a

      m[j]+=1

counter75=0

counter25=0

counter15=0

counter5=0

counter3=0

for i in range(101):

  if m[i]>=74:

    counter75+=1

  if m[i]>=24:

    counter25+=1

  if m[i]>=14:

    counter15+=1

  if m[i]>=4:

    counter5+=1

  if m[i]>=2:

    counter3+=1

a=(counter5*(counter5-1)*(counter3-2))//2

while (a+1)*2<=(counter5*(counter5-1)*(counter3-2)):

  a+=1

print((counter75+counter25*(counter3-1)+counter15*(counter5-1)+a))

import sys

primes=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]

num3=0

num5=0

num15=0

num25=0

num75=0

n=int(eval(input()))

for i in primes:

  tmp=0

  j=1

  while n//pow(i,j)>0:

    tmp+=n//pow(i,j)

    j+=1

  if tmp>=2:

    num3+=1

  if tmp>=4:

    num5+=1

  if tmp>=14:

    num15+=1

  if tmp>=24:

    num25+=1

  if tmp>=74:

    num75+=1

print((num75+max(0,(num3-1)*num25)+max(0,((num3-2)*(num5-1)*num5)//2)+max(0,((num5-1)*num15))))



  
n = int(eval(input()))
m = [0] * 101
for i in range(1, n + 1):
    for j in range(2, n + 1):
        while i % j == 0:
            a = i // j
            while (a + 1) * j <= i:
                a += 1
            i = a
            m[j] += 1
counter75 = 0
counter25 = 0
counter15 = 0
counter5 = 0
counter3 = 0
for i in range(101):
    if m[i] >= 74:
        counter75 += 1
    if m[i] >= 24:
        counter25 += 1
    if m[i] >= 14:
        counter15 += 1
    if m[i] >= 4:
        counter5 += 1
    if m[i] >= 2:
        counter3 += 1
a = (counter5 * (counter5 - 1) * (counter3 - 2)) // 2
while (a + 1) * 2 <= (counter5 * (counter5 - 1) * (counter3 - 2)):
    a += 1
print((counter75 + counter25 * (counter3 - 1) + counter15 * (counter5 - 1) + a))

import sys

primes = [
    2,
    3,
    5,
    7,
    11,
    13,
    17,
    19,
    23,
    29,
    31,
    37,
    41,
    43,
    47,
    53,
    59,
    61,
    67,
    71,
    73,
    79,
    83,
    89,
    97,
]
num3 = 0
num5 = 0
num15 = 0
num25 = 0
num75 = 0
n = int(eval(input()))
for i in primes:
    tmp = 0
    j = 1
    while n // pow(i, j) > 0:
        tmp += n // pow(i, j)
        j += 1
    if tmp >= 2:
        num3 += 1
    if tmp >= 4:
        num5 += 1
    if tmp >= 14:
        num15 += 1
    if tmp >= 24:
        num25 += 1
    if tmp >= 74:
        num75 += 1
print(
    (
        num75
        + max(0, (num3 - 1) * num25)
        + max(0, ((num3 - 2) * (num5 - 1) * num5) // 2)
        + max(0, ((num5 - 1) * num15))
    )
)

+import sys + +primes = [ +    2, +    3, +    5, +    7, +    11, +    13, +    17, +    19, +    23, +    29, +    31, +    37, +    41, +    43, +    47, +    53, +    59, +    61, +    67, +    71, +    73, +    79, +    83, +    89, +    97, +] +num3 = 0 +num5 = 0 +num15 = 0 +num25 = 0 +num75 = 0 -m = [0] * 101 -for i in range(1, n + 1): -    for j in range(2, n + 1): -        while i % j == 0: -            a = i // j -            while (a + 1) * j <= i: -                a += 1 -            i = a -            m[j] += 1 -counter75 = 0 -counter25 = 0 -counter15 = 0 -counter5 = 0 -counter3 = 0 -for i in range(101): -    if m[i] >= 74: -        counter75 += 1 -    if m[i] >= 24: -        counter25 += 1 -    if m[i] >= 14: -        counter15 += 1 -    if m[i] >= 4: -        counter5 += 1 -    if m[i] >= 2: -        counter3 += 1 -a = (counter5 * (counter5 - 1) * (counter3 - 2)) // 2 -while (a + 1) * 2 <= (counter5 * (counter5 - 1) * (counter3 - 2)): -    a += 1 -print((counter75 + counter25 * (counter3 - 1) + counter15 * (counter5 - 1) + a)) +for i in primes: +    tmp = 0 +    j = 1 +    while n // pow(i, j) > 0: +        tmp += n // pow(i, j) +        j += 1 +    if tmp >= 2: +        num3 += 1 +    if tmp >= 4: +        num5 += 1 +    if tmp >= 14: +        num15 += 1 +    if tmp >= 24: +        num25 += 1 +    if tmp >= 74: +        num75 += 1 +print( +    ( +        num75 +        + max(0, (num3 - 1) * num25) +        + max(0, ((num3 - 2) * (num5 - 1) * num5) // 2) +        + max(0, ((num5 - 1) * num15)) +    ) +)