import sys

input = sys.stdin.readline



n = int(eval(input()))



def factorization(n):

    arr = []

    temp = n

    for i in range(2, int(-(-n**0.5//1)) + 1):

        if temp%i==0:

            cnt = 0

            while temp%i==0:

                cnt += 1

                temp //= i

            arr.append([i, cnt])

    if temp!=1:

        arr.append([temp, 1])

    

    if arr ==[]:

        arr.append([n, 1])

    

    return arr



from collections import defaultdict



d = defaultdict(int)



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

    arr = factorization(i)

    for j in arr:

        d[j[0]] += j[1]

v = list(d.values())



from collections import Counter



c = Counter(v)

li = [0]*5



for i in list(c.keys()):

    if i >= 2:

        li[0] += c[i] # 2

    if i >= 4:

        li[1] += c[i] # 4

    if i >= 14:

        li[2] += c[i] # 14

    if i >= 24:

        li[3] += c[i] # 24

    if i >= 74:

        li[4] += c[i] # 74



ans = 0

ans += li[1] * (li[1] - 1) // 2 * (li[0] - 2)

ans += li[2] * (li[1] - 1)

ans += li[3] * (li[0] - 1)

ans += li[4]



print(ans)
import sys

input = lambda: sys.stdin.readline().rstrip()

 

n = int(eval(input()))

def prime_factorize(n):

    a = []

    while n % 2 == 0:

        a.append(2)

        n //= 2

    f = 3

    while f * f <= n:

        if n % f == 0:

            a.append(f)

            n //= f

        else:

            f += 2

    if n != 1:

        a.append(n)

    return a

from collections import defaultdict

d = defaultdict(int)

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

    a = prime_factorize(i)

    for j in a:

        d[j] += 1

cnt_74 = []

cnt_2 = []

cnt_4 = []

cnt_14 = []

cnt_24 = []

for i in d:

    if d[i] >= 74:

        cnt_74.append(i)

    if d[i] >= 2:

        cnt_2.append(i)

    if d[i] >= 4:

        cnt_4.append(i)

    if d[i] >= 14:

        cnt_14.append(i)

    if d[i] >= 24:

        cnt_24.append(i)

ans = 0

ans += len(cnt_74)



for i in cnt_2:

    for j in cnt_24:

        if i != j:

            ans += 1

for i in cnt_4:

    for j in cnt_14:

        if i != j:

            ans += 1

for i in cnt_2:

    for j in range(len(cnt_4)):

        for k in range(j + 1, len(cnt_4)):

            j_ = cnt_4[j]

            k_ = cnt_4[k]

            if i != j_ and j_ != k_ and k_ != i:

                ans += 1

print(ans)

#print(d)

import sys

input = sys.stdin.readline
n = int(eval(input()))


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-(n**0.5) // 1)) + 1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])
    if temp != 1:
        arr.append([temp, 1])
    if arr == []:
        arr.append([n, 1])
    return arr


from collections import defaultdict

d = defaultdict(int)
for i in range(2, n + 1):
    arr = factorization(i)
    for j in arr:
        d[j[0]] += j[1]
v = list(d.values())
from collections import Counter

c = Counter(v)
li = [0] * 5
for i in list(c.keys()):
    if i >= 2:
        li[0] += c[i]  # 2
    if i >= 4:
        li[1] += c[i]  # 4
    if i >= 14:
        li[2] += c[i]  # 14
    if i >= 24:
        li[3] += c[i]  # 24
    if i >= 74:
        li[4] += c[i]  # 74
ans = 0
ans += li[1] * (li[1] - 1) // 2 * (li[0] - 2)
ans += li[2] * (li[1] - 1)
ans += li[3] * (li[0] - 1)
ans += li[4]
print(ans)

import sys

input = lambda: sys.stdin.readline().rstrip()
n = int(eval(input()))


def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a


from collections import defaultdict

d = defaultdict(int)
for i in range(2, n + 1):
    a = prime_factorize(i)
    for j in a:
        d[j] += 1
cnt_74 = []
cnt_2 = []
cnt_4 = []
cnt_14 = []
cnt_24 = []
for i in d:
    if d[i] >= 74:
        cnt_74.append(i)
    if d[i] >= 2:
        cnt_2.append(i)
    if d[i] >= 4:
        cnt_4.append(i)
    if d[i] >= 14:
        cnt_14.append(i)
    if d[i] >= 24:
        cnt_24.append(i)
ans = 0
ans += len(cnt_74)
for i in cnt_2:
    for j in cnt_24:
        if i != j:
            ans += 1
for i in cnt_4:
    for j in cnt_14:
        if i != j:
            ans += 1
for i in cnt_2:
    for j in range(len(cnt_4)):
        for k in range(j + 1, len(cnt_4)):
            j_ = cnt_4[j]
            k_ = cnt_4[k]
            if i != j_ and j_ != k_ and k_ != i:
                ans += 1
print(ans)
# print(d)

-input = sys.stdin.readline +input = lambda: sys.stdin.readline().rstrip() -def factorization(n): -    arr = [] -    temp = n -    for i in range(2, int(-(-(n**0.5) // 1)) + 1): -        if temp % i == 0: -            cnt = 0 -            while temp % i == 0: -                cnt += 1 -                temp //= i -            arr.append([i, cnt]) -    if temp != 1: -        arr.append([temp, 1]) -    if arr == []: -        arr.append([n, 1]) -    return arr +def prime_factorize(n): +    a = [] +    while n % 2 == 0: +        a.append(2) +        n //= 2 +    f = 3 +    while f * f <= n: +        if n % f == 0: +            a.append(f) +            n //= f +        else: +            f += 2 +    if n != 1: +        a.append(n) +    return a -    arr = factorization(i) -    for j in arr: -        d[j[0]] += j[1] -v = list(d.values()) -from collections import Counter - -c = Counter(v) -li = [0] * 5 -for i in list(c.keys()): -    if i >= 2: -        li[0] += c[i]  # 2 -    if i >= 4: -        li[1] += c[i]  # 4 -    if i >= 14: -        li[2] += c[i]  # 14 -    if i >= 24: -        li[3] += c[i]  # 24 -    if i >= 74: -        li[4] += c[i]  # 74 +    a = prime_factorize(i) +    for j in a: +        d[j] += 1 +cnt_74 = [] +cnt_2 = [] +cnt_4 = [] +cnt_14 = [] +cnt_24 = [] +for i in d: +    if d[i] >= 74: +        cnt_74.append(i) +    if d[i] >= 2: +        cnt_2.append(i) +    if d[i] >= 4: +        cnt_4.append(i) +    if d[i] >= 14: +        cnt_14.append(i) +    if d[i] >= 24: +        cnt_24.append(i) -ans += li[1] * (li[1] - 1) // 2 * (li[0] - 2) -ans += li[2] * (li[1] - 1) -ans += li[3] * (li[0] - 1) -ans += li[4] +ans += len(cnt_74) +for i in cnt_2: +    for j in cnt_24: +        if i != j: +            ans += 1 +for i in cnt_4: +    for j in cnt_14: +        if i != j: +            ans += 1 +for i in cnt_2: +    for j in range(len(cnt_4)): +        for k in range(j + 1, len(cnt_4)): +            j_ = cnt_4[j] +            k_ = cnt_4[k] +            if i != j_ and j_ != k_ and k_ != i: +                ans += 1 +# print(d)