# 因数を昇順に全列挙

from collections import Counter

import math

def com(n,r):

    return math.factorial(n) // (math.factorial(n-r) * math.factorial(r))

fac_list = []

def factoring(n):

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

        if n % i == 0:

            fac_list.append(i)

            n = n // i

            break

    if n == 1:

        return fac_list

    else:

        return factoring(n)

# (素因数,指数)

n = int(eval(input()))

c = list(Counter(factoring(math.factorial(n))).values())

# 指数 (2,4,4),(2,24),(4,14),(74) の場合の数

l = [0]*5 # [2,4,14,24,74]

for e in c:

    if e >= 74:

        index = 4

    elif e >= 24:

        index = 3

    elif e >= 14:

        index = 2

    elif e >= 4:

        index = 1

    elif e >= 2:

        index = 0

    else:

        continue

    l[index] += 1

sum_l = sum(l)

num_74 = l[4]

if sum_l - l[0] - 1 > 0:

    num_4_14 = (l[2] + l[3] + l[4])*(sum_l - l[0] - 1)

else:

    num_4_14 = 0

if sum_l - 1 > 0:

    num_2_24 = (l[3] + l[4])*(sum_l - 1)

else:

    num_2_24 = 0

if sum_l - l[0] >= 2:

    num_2_4_4 = com(sum_l-l[0],2)*(sum_l - 2)

else:

    num_2_4_4 = 0

ans = num_74 + num_4_14 + num_2_24 + num_2_4_4

print(ans)
def factoring(n):

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

        while n % i == 0:

            n //= i

            d[i] += 1



N = int(eval(input()))



d = [0]*(N+1)



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

    factoring(n)



def num(n):

    return len([e for e in d if e >= n])



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

print(ans)
# 因数を昇順に全列挙
from collections import Counter
import math


def com(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))


fac_list = []


def factoring(n):
    for i in range(2, n + 1):
        if n % i == 0:
            fac_list.append(i)
            n = n // i
            break
    if n == 1:
        return fac_list
    else:
        return factoring(n)


# (素因数,指数)
n = int(eval(input()))
c = list(Counter(factoring(math.factorial(n))).values())
# 指数 (2,4,4),(2,24),(4,14),(74) の場合の数
l = [0] * 5  # [2,4,14,24,74]
for e in c:
    if e >= 74:
        index = 4
    elif e >= 24:
        index = 3
    elif e >= 14:
        index = 2
    elif e >= 4:
        index = 1
    elif e >= 2:
        index = 0
    else:
        continue
    l[index] += 1
sum_l = sum(l)
num_74 = l[4]
if sum_l - l[0] - 1 > 0:
    num_4_14 = (l[2] + l[3] + l[4]) * (sum_l - l[0] - 1)
else:
    num_4_14 = 0
if sum_l - 1 > 0:
    num_2_24 = (l[3] + l[4]) * (sum_l - 1)
else:
    num_2_24 = 0
if sum_l - l[0] >= 2:
    num_2_4_4 = com(sum_l - l[0], 2) * (sum_l - 2)
else:
    num_2_4_4 = 0
ans = num_74 + num_4_14 + num_2_24 + num_2_4_4
print(ans)

def factoring(n):
    for i in range(2, n + 1):
        while n % i == 0:
            n //= i
            d[i] += 1


N = int(eval(input()))
d = [0] * (N + 1)
for n in range(2, N + 1):
    factoring(n)


def num(n):
    return len([e for e in d if e >= n])


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

-# 因数を昇順に全列挙 -from collections import Counter -import math +def factoring(n): +    for i in range(2, n + 1): +        while n % i == 0: +            n //= i +            d[i] += 1 -def com(n, r): -    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) +N = int(eval(input())) +d = [0] * (N + 1) +for n in range(2, N + 1): +    factoring(n) -fac_list = [] +def num(n): +    return len([e for e in d if e >= n]) -def factoring(n): -    for i in range(2, n + 1): -        if n % i == 0: -            fac_list.append(i) -            n = n // i -            break -    if n == 1: -        return fac_list -    else: -        return factoring(n) - - -# (素因数,指数) -n = int(eval(input())) -c = list(Counter(factoring(math.factorial(n))).values()) -# 指数 (2,4,4),(2,24),(4,14),(74) の場合の数 -l = [0] * 5  # [2,4,14,24,74] -for e in c: -    if e >= 74: -        index = 4 -    elif e >= 24: -        index = 3 -    elif e >= 14: -        index = 2 -    elif e >= 4: -        index = 1 -    elif e >= 2: -        index = 0 -    else: -        continue -    l[index] += 1 -sum_l = sum(l) -num_74 = l[4] -if sum_l - l[0] - 1 > 0: -    num_4_14 = (l[2] + l[3] + l[4]) * (sum_l - l[0] - 1) -else: -    num_4_14 = 0 -if sum_l - 1 > 0: -    num_2_24 = (l[3] + l[4]) * (sum_l - 1) -else: -    num_2_24 = 0 -if sum_l - l[0] >= 2: -    num_2_4_4 = com(sum_l - l[0], 2) * (sum_l - 2) -else: -    num_2_4_4 = 0 -ans = num_74 + num_4_14 + num_2_24 + num_2_4_4 +ans = ( +    num(74) +    + num(14) * (num(4) - 1) +    + num(24) * (num(2) - 1) +    + num(4) * (num(4) - 1) * (num(2) - 2) // 2 +)