N = int(eval(input()))

lim = 1

for i in range(N): lim *= (i+1)

Prime = [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 = 0

for i in range(23):

    for j in range(i+1, 24):

        for k in range(j+1, 25):

            a, b, c = Prime[i], Prime[j], Prime[k]

            d, e, f = (a**4)*(b**4)*(c**2), (a**4)*(b**2)*(c**4), (a**2)*(b**4)*(c**4)

            if d <= lim and lim%d == 0: Ans += 1

            if e <= lim and lim%e == 0: Ans += 1

            if f <= lim and lim%f == 0: Ans += 1

for i in range(24):

    for j in range(i+1, 25):

        a, b = Prime[i], Prime[j]

        d, e, f, g = (a**24)*(b**2), (a**2)*(b**24), (a**4)*(b**14), (a**14)*(b**4)

        if d <= lim and lim%d == 0: Ans += 1

        if e <= lim and lim%e == 0: Ans += 1

        if f <= lim and lim%f == 0: Ans += 1

        if g <= lim and lim%g == 0: Ans += 1

for i in range(5):

    if Prime[i] ** 74 <= lim and lim % (Prime[i]**74) == 0: Ans += 1

print(Ans)
import sys

from collections import defaultdict



def solve():

    input = sys.stdin.readline

    N = int(eval(input()))

    primes = defaultdict(int)

    ans = 0

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

        k = i

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

            if j ** 2 > i: break

            if k % j == 0:

                while k % j == 0:

                    primes[j] += 1

                    k //= j

        if k > 1: primes[k] += 1

    P = []

    for key in primes: P.append(primes[key])

    pn = len(P)



    for i in range(pn):

        if P[i] >= 74: ans += 1

        if P[i] >= 24:

            for j in range(pn):

                if P[j] >= 2 and j != i: ans += 1

        if P[i] >= 14:

            for j in range(pn):

                if P[j] >= 4 and j != i: ans += 1

        if P[i] >= 4:

            for j in range(i+1, pn):

                if P[j] >= 4:

                    for k in range(pn):

                        if P[k] >= 2 and k != i and k != j: ans += 1

    print(ans)

    #print(primes)

    #print(P)



    return 0



if __name__ == "__main__":

    solve()
N = int(eval(input()))
lim = 1
for i in range(N):
    lim *= i + 1
Prime = [
    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 = 0
for i in range(23):
    for j in range(i + 1, 24):
        for k in range(j + 1, 25):
            a, b, c = Prime[i], Prime[j], Prime[k]
            d, e, f = (
                (a**4) * (b**4) * (c**2),
                (a**4) * (b**2) * (c**4),
                (a**2) * (b**4) * (c**4),
            )
            if d <= lim and lim % d == 0:
                Ans += 1
            if e <= lim and lim % e == 0:
                Ans += 1
            if f <= lim and lim % f == 0:
                Ans += 1
for i in range(24):
    for j in range(i + 1, 25):
        a, b = Prime[i], Prime[j]
        d, e, f, g = (
            (a**24) * (b**2),
            (a**2) * (b**24),
            (a**4) * (b**14),
            (a**14) * (b**4),
        )
        if d <= lim and lim % d == 0:
            Ans += 1
        if e <= lim and lim % e == 0:
            Ans += 1
        if f <= lim and lim % f == 0:
            Ans += 1
        if g <= lim and lim % g == 0:
            Ans += 1
for i in range(5):
    if Prime[i] ** 74 <= lim and lim % (Prime[i] ** 74) == 0:
        Ans += 1
print(Ans)

import sys
from collections import defaultdict


def solve():
    input = sys.stdin.readline
    N = int(eval(input()))
    primes = defaultdict(int)
    ans = 0
    for i in range(1, N + 1):
        k = i
        for j in range(2, i + 1):
            if j**2 > i:
                break
            if k % j == 0:
                while k % j == 0:
                    primes[j] += 1
                    k //= j
        if k > 1:
            primes[k] += 1
    P = []
    for key in primes:
        P.append(primes[key])
    pn = len(P)
    for i in range(pn):
        if P[i] >= 74:
            ans += 1
        if P[i] >= 24:
            for j in range(pn):
                if P[j] >= 2 and j != i:
                    ans += 1
        if P[i] >= 14:
            for j in range(pn):
                if P[j] >= 4 and j != i:
                    ans += 1
        if P[i] >= 4:
            for j in range(i + 1, pn):
                if P[j] >= 4:
                    for k in range(pn):
                        if P[k] >= 2 and k != i and k != j:
                            ans += 1
    print(ans)
    # print(primes)
    # print(P)
    return 0


if __name__ == "__main__":
    solve()

-N = int(eval(input())) -lim = 1 -for i in range(N): -    lim *= i + 1 -Prime = [ -    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 = 0 -for i in range(23): -    for j in range(i + 1, 24): -        for k in range(j + 1, 25): -            a, b, c = Prime[i], Prime[j], Prime[k] -            d, e, f = ( -                (a**4) * (b**4) * (c**2), -                (a**4) * (b**2) * (c**4), -                (a**2) * (b**4) * (c**4), -            ) -            if d <= lim and lim % d == 0: -                Ans += 1 -            if e <= lim and lim % e == 0: -                Ans += 1 -            if f <= lim and lim % f == 0: -                Ans += 1 -for i in range(24): -    for j in range(i + 1, 25): -        a, b = Prime[i], Prime[j] -        d, e, f, g = ( -            (a**24) * (b**2), -            (a**2) * (b**24), -            (a**4) * (b**14), -            (a**14) * (b**4), -        ) -        if d <= lim and lim % d == 0: -            Ans += 1 -        if e <= lim and lim % e == 0: -            Ans += 1 -        if f <= lim and lim % f == 0: -            Ans += 1 -        if g <= lim and lim % g == 0: -            Ans += 1 -for i in range(5): -    if Prime[i] ** 74 <= lim and lim % (Prime[i] ** 74) == 0: -        Ans += 1 -print(Ans) +import sys +from collections import defaultdict + + +def solve(): +    input = sys.stdin.readline +    N = int(eval(input())) +    primes = defaultdict(int) +    ans = 0 +    for i in range(1, N + 1): +        k = i +        for j in range(2, i + 1): +            if j**2 > i: +                break +            if k % j == 0: +                while k % j == 0: +                    primes[j] += 1 +                    k //= j +        if k > 1: +            primes[k] += 1 +    P = [] +    for key in primes: +        P.append(primes[key]) +    pn = len(P) +    for i in range(pn): +        if P[i] >= 74: +            ans += 1 +        if P[i] >= 24: +            for j in range(pn): +                if P[j] >= 2 and j != i: +                    ans += 1 +        if P[i] >= 14: +            for j in range(pn): +                if P[j] >= 4 and j != i: +                    ans += 1 +        if P[i] >= 4: +            for j in range(i + 1, pn): +                if P[j] >= 4: +                    for k in range(pn): +                        if P[k] >= 2 and k != i and k != j: +                            ans += 1 +    print(ans) +    # print(primes) +    # print(P) +    return 0 + + +if __name__ == "__main__": +    solve()