from math import factorial

from itertools import permutations



n=int(eval(input()))

np=factorial(n)

p_list=[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]



ans=[]

for s,t,u in permutations(p_list,3):

  num1=(s**4)*(t**4)*(u**2)

  num2=(s**14)*(t**4)

  num3=(s**24)*(t**2)

  num4=s**74

  for z in [num1,num2,num3,num4]:

    if np%z==0:

      ans.append(z)



print((len(set(ans))))
from collections import Counter

from itertools import permutations



n=int(eval(input()))



def factorization(n):

    p=2

    fcr=[]

    while p*p<=n:

        while n%p==0:

            fcr.append(p)

            n//=p

        p+=1

    if n>1:

        fcr.append(n)

    return fcr





fcr_l=[]

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

  fcr=factorization(i)

  fcr_l+=fcr





c=Counter(fcr_l)

fcr_st=set(fcr_l)



ans=[]

for p,q,r in permutations(fcr_st,3):

  if c[p]>=74:

    ans.append(p**74)

  if c[p]>=24 and c[q]>=2:

    ans.append((p**24)*(q**2))

  if c[p]>=14 and c[q]>=4:

    ans.append((p**14)*(q**4))

  if c[p]>=4 and c[q]>=4 and c[r]>=2:

    ans.append((p**4)*(q**4)*(r**2))



print((len(set(ans))))
from math import factorial
from itertools import permutations

n = int(eval(input()))
np = factorial(n)
p_list = [
    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,
]
ans = []
for s, t, u in permutations(p_list, 3):
    num1 = (s**4) * (t**4) * (u**2)
    num2 = (s**14) * (t**4)
    num3 = (s**24) * (t**2)
    num4 = s**74
    for z in [num1, num2, num3, num4]:
        if np % z == 0:
            ans.append(z)
print((len(set(ans))))

from collections import Counter
from itertools import permutations

n = int(eval(input()))


def factorization(n):
    p = 2
    fcr = []
    while p * p <= n:
        while n % p == 0:
            fcr.append(p)
            n //= p
        p += 1
    if n > 1:
        fcr.append(n)
    return fcr


fcr_l = []
for i in range(1, n + 1):
    fcr = factorization(i)
    fcr_l += fcr
c = Counter(fcr_l)
fcr_st = set(fcr_l)
ans = []
for p, q, r in permutations(fcr_st, 3):
    if c[p] >= 74:
        ans.append(p**74)
    if c[p] >= 24 and c[q] >= 2:
        ans.append((p**24) * (q**2))
    if c[p] >= 14 and c[q] >= 4:
        ans.append((p**14) * (q**4))
    if c[p] >= 4 and c[q] >= 4 and c[r] >= 2:
        ans.append((p**4) * (q**4) * (r**2))
print((len(set(ans))))

-from math import factorial +from collections import Counter -np = factorial(n) -p_list = [ -    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, -] + + +def factorization(n): +    p = 2 +    fcr = [] +    while p * p <= n: +        while n % p == 0: +            fcr.append(p) +            n //= p +        p += 1 +    if n > 1: +        fcr.append(n) +    return fcr + + +fcr_l = [] +for i in range(1, n + 1): +    fcr = factorization(i) +    fcr_l += fcr +c = Counter(fcr_l) +fcr_st = set(fcr_l) -for s, t, u in permutations(p_list, 3): -    num1 = (s**4) * (t**4) * (u**2) -    num2 = (s**14) * (t**4) -    num3 = (s**24) * (t**2) -    num4 = s**74 -    for z in [num1, num2, num3, num4]: -        if np % z == 0: -            ans.append(z) +for p, q, r in permutations(fcr_st, 3): +    if c[p] >= 74: +        ans.append(p**74) +    if c[p] >= 24 and c[q] >= 2: +        ans.append((p**24) * (q**2)) +    if c[p] >= 14 and c[q] >= 4: +        ans.append((p**14) * (q**4)) +    if c[p] >= 4 and c[q] >= 4 and c[r] >= 2: +        ans.append((p**4) * (q**4) * (r**2))