N = int(eval(input()))

from math import ceil, sqrt, factorial

from itertools import permutations

def eratosthenes(n):

    l = [1 for i in range(n+1)]

    l[0] = l[1] = 0

    for i in range(2, ceil(sqrt(n))):

        if l[i] == 0: continue

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

            l[j] = 0

    return l



m = factorial(N)

ans = set()



p = eratosthenes(530)



p = [i for i,v in enumerate(p) if v ]



for i in p:

    a = i**74

    if not m % a:

        ans.add(a)

        break



for a,b in permutations(p,2):

    c = a**2*b**24

    if not m % c:

        ans.add(c)

    c = a**4*b**14

    if not m % c:

        ans.add(c)



for a,b,c in permutations(p, 3):

    d = a**2 * b**4 * c ** 4

    if not m % d:

        ans.add(d)



print((len(ans)))

N = int(eval(input()))

p = [0] * (N+1)





def is_prime(n):

    for i in range(2, n):

        if not n % i:

            return False

    return True





def n(m):

    return sum([True for i in p if i >= m])





l = [i for i in range(2, N+1) if is_prime(i)]

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

    for j in l:

        while not i % j:

            p[j] += 1

            i //= j



print((n(74) +

      (n(2)-1) * n(24) +

      (n(2)-2) * ((n(4)-1) * n(4))//2 +

      (n(4)-1) * n(14)))
N = int(eval(input()))
from math import ceil, sqrt, factorial
from itertools import permutations


def eratosthenes(n):
    l = [1 for i in range(n + 1)]
    l[0] = l[1] = 0
    for i in range(2, ceil(sqrt(n))):
        if l[i] == 0:
            continue
        for j in range(i * 2, n + 1, i):
            l[j] = 0
    return l


m = factorial(N)
ans = set()
p = eratosthenes(530)
p = [i for i, v in enumerate(p) if v]
for i in p:
    a = i**74
    if not m % a:
        ans.add(a)
        break
for a, b in permutations(p, 2):
    c = a**2 * b**24
    if not m % c:
        ans.add(c)
    c = a**4 * b**14
    if not m % c:
        ans.add(c)
for a, b, c in permutations(p, 3):
    d = a**2 * b**4 * c**4
    if not m % d:
        ans.add(d)
print((len(ans)))

N = int(eval(input()))
p = [0] * (N + 1)


def is_prime(n):
    for i in range(2, n):
        if not n % i:
            return False
    return True


def n(m):
    return sum([True for i in p if i >= m])


l = [i for i in range(2, N + 1) if is_prime(i)]
for i in range(2, N + 1):
    for j in l:
        while not i % j:
            p[j] += 1
            i //= j
print(
    (
        n(74)
        + (n(2) - 1) * n(24)
        + (n(2) - 2) * ((n(4) - 1) * n(4)) // 2
        + (n(4) - 1) * n(14)
    )
)

-from math import ceil, sqrt, factorial -from itertools import permutations +p = [0] * (N + 1) -def eratosthenes(n): -    l = [1 for i in range(n + 1)] -    l[0] = l[1] = 0 -    for i in range(2, ceil(sqrt(n))): -        if l[i] == 0: -            continue -        for j in range(i * 2, n + 1, i): -            l[j] = 0 -    return l +def is_prime(n): +    for i in range(2, n): +        if not n % i: +            return False +    return True -m = factorial(N) -ans = set() -p = eratosthenes(530) -p = [i for i, v in enumerate(p) if v] -for i in p: -    a = i**74 -    if not m % a: -        ans.add(a) -        break -for a, b in permutations(p, 2): -    c = a**2 * b**24 -    if not m % c: -        ans.add(c) -    c = a**4 * b**14 -    if not m % c: -        ans.add(c) -for a, b, c in permutations(p, 3): -    d = a**2 * b**4 * c**4 -    if not m % d: -        ans.add(d) -print((len(ans))) +def n(m): +    return sum([True for i in p if i >= m]) + + +l = [i for i in range(2, N + 1) if is_prime(i)] +for i in range(2, N + 1): +    for j in l: +        while not i % j: +            p[j] += 1 +            i //= j +print( +    ( +        n(74) +        + (n(2) - 1) * n(24) +        + (n(2) - 2) * ((n(4) - 1) * n(4)) // 2 +        + (n(4) - 1) * n(14) +    ) +)