import itertools

from collections import Counter



n = int(eval(input()))



# 素因数分解した結果のリスト

# {1: [], 2: [2], 3: [3], 4: [2, 2], 5: [5]}

divs = {}

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]



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

    divs[i] = []

    x = i

    while x >= 2:

        for p in primes:

            if x % p == 0:

                x //= p

                divs[i].append(p)



# flatten

fdivs = list(itertools.chain.from_iterable(list(divs.values())))

counts = Counter(fdivs)



ans = 0

# 75==5*5*3

# https://juken-mikata.net/how-to/mathematics/number-of-divisor.html

# 4, 4, 2 選んだら75数になる

ge4 = len([c for c in list(counts.values()) if c >= 4])

ge2 = len([c for c in list(counts.values()) if c >= 2])

ans += ge4 * (ge4 - 1) / 2 * (ge2 - 2)



# 75==5*15

# 4, 14 選ぶ

ge14 = len([c for c in list(counts.values()) if c >= 14])

ans += ge14 * (ge4 - 1)



# 75==25*3

# 24, 2 選ぶ

ge24 = len([c for c in list(counts.values()) if c >= 24])

ans += ge24 * (ge2 - 1)



# 75 ==75*1

# 74 選ぶ

ge74 = len([c for c in list(counts.values()) if c >= 74])

ans += ge74



print((int(ans)))

import itertools

import math

import os

import sys



if os.getenv("LOCAL"):

    sys.stdin = open("_in.txt", "r")



sys.setrecursionlimit(10 ** 9)

INF = float("inf")

IINF = 10 ** 18

MOD = 10 ** 9 + 7





# MOD = 998244353





def get_factors(n):

    """

    素因数分解

    :param int n:

    :rtype: list of int

    """

    if n <= 1:

        return []



    ret = []

    while n > 2 and n % 2 == 0:

        ret.append(2)

        n //= 2

    i = 3

    while i <= math.sqrt(n):

        if n % i == 0:

            ret.append(i)

            n //= i

        else:

            i += 2

    ret.append(n)

    return ret





N = int(sys.stdin.buffer.readline())



counts = [0] * 101

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

    for f in get_factors(n):

        counts[f] += 1



t = []

for c in counts:

    if c >= 2:

        t.append(c)

counts = t



# 素因数の使い方のパターン数が

# 3, 25 と 3, 5, 5 と 15, 5 と 75 のとき約数が75個

ans = 0

for i, j, k in itertools.combinations(list(range(len(counts))), r=3):

    if counts[i] >= 2 and counts[j] >= 4 and counts[k] >= 4:

        ans += 1

    if counts[i] >= 4 and counts[j] >= 2 and counts[k] >= 4:

        ans += 1

    if counts[i] >= 4 and counts[j] >= 4 and counts[k] >= 2:

        ans += 1

for i, j in itertools.combinations(list(range(len(counts))), r=2):

    if counts[i] >= 2 and counts[j] >= 24:

        ans += 1

    if counts[i] >= 24 and counts[j] >= 2:

        ans += 1

    if counts[i] >= 4 and counts[j] >= 14:

        ans += 1

    if counts[i] >= 14 and counts[j] >= 4:

        ans += 1

for c in counts:

    if c >= 74:

        ans += 1

print(ans)

import itertools
from collections import Counter

n = int(eval(input()))
# 素因数分解した結果のリスト
# {1: [], 2: [2], 3: [3], 4: [2, 2], 5: [5]}
divs = {}
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,
]
for i in range(1, n + 1):
    divs[i] = []
    x = i
    while x >= 2:
        for p in primes:
            if x % p == 0:
                x //= p
                divs[i].append(p)
# flatten
fdivs = list(itertools.chain.from_iterable(list(divs.values())))
counts = Counter(fdivs)
ans = 0
# 75==5*5*3
# https://juken-mikata.net/how-to/mathematics/number-of-divisor.html
# 4, 4, 2 選んだら75数になる
ge4 = len([c for c in list(counts.values()) if c >= 4])
ge2 = len([c for c in list(counts.values()) if c >= 2])
ans += ge4 * (ge4 - 1) / 2 * (ge2 - 2)
# 75==5*15
# 4, 14 選ぶ
ge14 = len([c for c in list(counts.values()) if c >= 14])
ans += ge14 * (ge4 - 1)
# 75==25*3
# 24, 2 選ぶ
ge24 = len([c for c in list(counts.values()) if c >= 24])
ans += ge24 * (ge2 - 1)
# 75 ==75*1
# 74 選ぶ
ge74 = len([c for c in list(counts.values()) if c >= 74])
ans += ge74
print((int(ans)))

import itertools
import math
import os
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10**9)
INF = float("inf")
IINF = 10**18
MOD = 10**9 + 7
# MOD = 998244353
def get_factors(n):
    """
    素因数分解
    :param int n:
    :rtype: list of int
    """
    if n <= 1:
        return []
    ret = []
    while n > 2 and n % 2 == 0:
        ret.append(2)
        n //= 2
    i = 3
    while i <= math.sqrt(n):
        if n % i == 0:
            ret.append(i)
            n //= i
        else:
            i += 2
    ret.append(n)
    return ret


N = int(sys.stdin.buffer.readline())
counts = [0] * 101
for n in range(1, N + 1):
    for f in get_factors(n):
        counts[f] += 1
t = []
for c in counts:
    if c >= 2:
        t.append(c)
counts = t
# 素因数の使い方のパターン数が
# 3, 25 と 3, 5, 5 と 15, 5 と 75 のとき約数が75個
ans = 0
for i, j, k in itertools.combinations(list(range(len(counts))), r=3):
    if counts[i] >= 2 and counts[j] >= 4 and counts[k] >= 4:
        ans += 1
    if counts[i] >= 4 and counts[j] >= 2 and counts[k] >= 4:
        ans += 1
    if counts[i] >= 4 and counts[j] >= 4 and counts[k] >= 2:
        ans += 1
for i, j in itertools.combinations(list(range(len(counts))), r=2):
    if counts[i] >= 2 and counts[j] >= 24:
        ans += 1
    if counts[i] >= 24 and counts[j] >= 2:
        ans += 1
    if counts[i] >= 4 and counts[j] >= 14:
        ans += 1
    if counts[i] >= 14 and counts[j] >= 4:
        ans += 1
for c in counts:
    if c >= 74:
        ans += 1
print(ans)

-from collections import Counter +import math +import os +import sys -n = int(eval(input())) -# 素因数分解した結果のリスト -# {1: [], 2: [2], 3: [3], 4: [2, 2], 5: [5]} -divs = {} -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, -] -for i in range(1, n + 1): -    divs[i] = [] -    x = i -    while x >= 2: -        for p in primes: -            if x % p == 0: -                x //= p -                divs[i].append(p) -# flatten -fdivs = list(itertools.chain.from_iterable(list(divs.values()))) -counts = Counter(fdivs) +if os.getenv("LOCAL"): +    sys.stdin = open("_in.txt", "r") +sys.setrecursionlimit(10**9) +INF = float("inf") +IINF = 10**18 +MOD = 10**9 + 7 +# MOD = 998244353 +def get_factors(n): +    """ +    素因数分解 +    :param int n: +    :rtype: list of int +    """ +    if n <= 1: +        return [] +    ret = [] +    while n > 2 and n % 2 == 0: +        ret.append(2) +        n //= 2 +    i = 3 +    while i <= math.sqrt(n): +        if n % i == 0: +            ret.append(i) +            n //= i +        else: +            i += 2 +    ret.append(n) +    return ret + + +N = int(sys.stdin.buffer.readline()) +counts = [0] * 101 +for n in range(1, N + 1): +    for f in get_factors(n): +        counts[f] += 1 +t = [] +for c in counts: +    if c >= 2: +        t.append(c) +counts = t +# 素因数の使い方のパターン数が +# 3, 25 と 3, 5, 5 と 15, 5 と 75 のとき約数が75個 -# 75==5*5*3 -# https://juken-mikata.net/how-to/mathematics/number-of-divisor.html -# 4, 4, 2 選んだら75数になる -ge4 = len([c for c in list(counts.values()) if c >= 4]) -ge2 = len([c for c in list(counts.values()) if c >= 2]) -ans += ge4 * (ge4 - 1) / 2 * (ge2 - 2) -# 75==5*15 -# 4, 14 選ぶ -ge14 = len([c for c in list(counts.values()) if c >= 14]) -ans += ge14 * (ge4 - 1) -# 75==25*3 -# 24, 2 選ぶ -ge24 = len([c for c in list(counts.values()) if c >= 24]) -ans += ge24 * (ge2 - 1) -# 75 ==75*1 -# 74 選ぶ -ge74 = len([c for c in list(counts.values()) if c >= 74]) -ans += ge74 -print((int(ans))) +for i, j, k in itertools.combinations(list(range(len(counts))), r=3): +    if counts[i] >= 2 and counts[j] >= 4 and counts[k] >= 4: +        ans += 1 +    if counts[i] >= 4 and counts[j] >= 2 and counts[k] >= 4: +        ans += 1 +    if counts[i] >= 4 and counts[j] >= 4 and counts[k] >= 2: +        ans += 1 +for i, j in itertools.combinations(list(range(len(counts))), r=2): +    if counts[i] >= 2 and counts[j] >= 24: +        ans += 1 +    if counts[i] >= 24 and counts[j] >= 2: +        ans += 1 +    if counts[i] >= 4 and counts[j] >= 14: +        ans += 1 +    if counts[i] >= 14 and counts[j] >= 4: +        ans += 1 +for c in counts: +    if c >= 74: +        ans += 1 +print(ans)