P = [1 for _ in range(100)]

P[0]=0

P[1]=0

for i in range(2,11):

    for j in range(i*i,100,i):

        P[j] = 0

Q = []

for i in range(2,100):

    if P[i]==1:

        Q.append(i)

C = {q:0 for q in Q}

N = int(eval(input()))

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

    x = i

    for q in Q:

        while x%q==0:

            x = x//q

            C[q] += 1

D = {2:0,4:0,14:0,24:0,74:0}

for q in Q:

    if C[q]>=2:

        D[2] += 1

    if C[q]>=4:

        D[4] += 1

    if C[q]>=14:

        D[14] += 1

    if C[q]>=24:

        D[24] += 1

    if C[q]>=74:

        D[74] += 1

cnt = D[74]

cnt += (D[2]-D[24])*D[24]+(D[24]*(D[24]-1))

cnt += (D[4]-D[14])*D[14]+(D[14]*(D[14]-1))

cnt += (D[2]-D[4])*(D[4]*(D[4]-1))//2+(D[4]*(D[4]-1)*(D[4]-2))//2

print(cnt)
P = [1 for _ in range(100)]

P[0]=0

P[1]=0

for i in range(2,11):

    for j in range(i**2,100,i):

        P[j] = 0

Q = []

for i in range(100):

    if P[i]==1:

        Q.append(i)

N = int(eval(input()))

C = {p:0 for p in Q}

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

    for p in Q:

        if i%p==0:

            x = i

            while x%p==0:

                x = x//p

                C[p] += 1

cnt = 0

for p in Q:

    if C[p]>=74:

        cnt += 1

cnt1 = 0

cnt2 = 0

for p in Q:

    if C[p]>=24:

        cnt2 += 1

    elif C[p]>=2:

        cnt1 += 1

cnt += cnt2*(cnt2-1)+cnt2*cnt1

cnt1 = 0

cnt2 = 0

for p in Q:

    if C[p]>=14:

        cnt2 += 1

    elif C[p]>=4:

        cnt1 += 1

cnt += cnt2*(cnt2-1)+cnt2*cnt1

cnt1 = 0

cnt2 = 0

for p in Q:

    if C[p]>=4:

        cnt2 += 1

    elif C[p]>=2:

        cnt1 += 1

cnt += (cnt2*(cnt2-1)*(cnt2-2))//2+((cnt2*(cnt2-1))//2)*cnt1

print(cnt)
P = [1 for _ in range(100)]
P[0] = 0
P[1] = 0
for i in range(2, 11):
    for j in range(i * i, 100, i):
        P[j] = 0
Q = []
for i in range(2, 100):
    if P[i] == 1:
        Q.append(i)
C = {q: 0 for q in Q}
N = int(eval(input()))
for i in range(2, N + 1):
    x = i
    for q in Q:
        while x % q == 0:
            x = x // q
            C[q] += 1
D = {2: 0, 4: 0, 14: 0, 24: 0, 74: 0}
for q in Q:
    if C[q] >= 2:
        D[2] += 1
    if C[q] >= 4:
        D[4] += 1
    if C[q] >= 14:
        D[14] += 1
    if C[q] >= 24:
        D[24] += 1
    if C[q] >= 74:
        D[74] += 1
cnt = D[74]
cnt += (D[2] - D[24]) * D[24] + (D[24] * (D[24] - 1))
cnt += (D[4] - D[14]) * D[14] + (D[14] * (D[14] - 1))
cnt += (D[2] - D[4]) * (D[4] * (D[4] - 1)) // 2 + (D[4] * (D[4] - 1) * (D[4] - 2)) // 2
print(cnt)

P = [1 for _ in range(100)]
P[0] = 0
P[1] = 0
for i in range(2, 11):
    for j in range(i**2, 100, i):
        P[j] = 0
Q = []
for i in range(100):
    if P[i] == 1:
        Q.append(i)
N = int(eval(input()))
C = {p: 0 for p in Q}
for i in range(2, N + 1):
    for p in Q:
        if i % p == 0:
            x = i
            while x % p == 0:
                x = x // p
                C[p] += 1
cnt = 0
for p in Q:
    if C[p] >= 74:
        cnt += 1
cnt1 = 0
cnt2 = 0
for p in Q:
    if C[p] >= 24:
        cnt2 += 1
    elif C[p] >= 2:
        cnt1 += 1
cnt += cnt2 * (cnt2 - 1) + cnt2 * cnt1
cnt1 = 0
cnt2 = 0
for p in Q:
    if C[p] >= 14:
        cnt2 += 1
    elif C[p] >= 4:
        cnt1 += 1
cnt += cnt2 * (cnt2 - 1) + cnt2 * cnt1
cnt1 = 0
cnt2 = 0
for p in Q:
    if C[p] >= 4:
        cnt2 += 1
    elif C[p] >= 2:
        cnt1 += 1
cnt += (cnt2 * (cnt2 - 1) * (cnt2 - 2)) // 2 + ((cnt2 * (cnt2 - 1)) // 2) * cnt1
print(cnt)

-    for j in range(i * i, 100, i): +    for j in range(i**2, 100, i): -for i in range(2, 100): +for i in range(100): -C = {q: 0 for q in Q} +C = {p: 0 for p in Q} -    x = i -    for q in Q: -        while x % q == 0: -            x = x // q -            C[q] += 1 -D = {2: 0, 4: 0, 14: 0, 24: 0, 74: 0} -for q in Q: -    if C[q] >= 2: -        D[2] += 1 -    if C[q] >= 4: -        D[4] += 1 -    if C[q] >= 14: -        D[14] += 1 -    if C[q] >= 24: -        D[24] += 1 -    if C[q] >= 74: -        D[74] += 1 -cnt = D[74] -cnt += (D[2] - D[24]) * D[24] + (D[24] * (D[24] - 1)) -cnt += (D[4] - D[14]) * D[14] + (D[14] * (D[14] - 1)) -cnt += (D[2] - D[4]) * (D[4] * (D[4] - 1)) // 2 + (D[4] * (D[4] - 1) * (D[4] - 2)) // 2 +    for p in Q: +        if i % p == 0: +            x = i +            while x % p == 0: +                x = x // p +                C[p] += 1 +cnt = 0 +for p in Q: +    if C[p] >= 74: +        cnt += 1 +cnt1 = 0 +cnt2 = 0 +for p in Q: +    if C[p] >= 24: +        cnt2 += 1 +    elif C[p] >= 2: +        cnt1 += 1 +cnt += cnt2 * (cnt2 - 1) + cnt2 * cnt1 +cnt1 = 0 +cnt2 = 0 +for p in Q: +    if C[p] >= 14: +        cnt2 += 1 +    elif C[p] >= 4: +        cnt1 += 1 +cnt += cnt2 * (cnt2 - 1) + cnt2 * cnt1 +cnt1 = 0 +cnt2 = 0 +for p in Q: +    if C[p] >= 4: +        cnt2 += 1 +    elif C[p] >= 2: +        cnt1 += 1 +cnt += (cnt2 * (cnt2 - 1) * (cnt2 - 2)) // 2 + ((cnt2 * (cnt2 - 1)) // 2) * cnt1