def prf(m):
    pf = {}
    for i in range(2,int(m**0.5)+1):
        while m % i == 0:
            pf[i] = pf.get(i,0)+1
            m //= i
    if m>1:pf[m] = 1
    return pf
import bisect
from collections import defaultdict
Pr = defaultdict(lambda: -1)

m = int(input())
for i in range(1,m+1):
    j = prf(i)
    for k, l in j.items():
        Pr[k] -= l
A = list(Pr.values())
a = dict() 
for i in [3,5,15,25,75]:
    a[i] = bisect.bisect_right(A,-i)
print(a[3]*a[5]*(a[5]-1)//2+(a[15]-a[5])*(a[5]-1)+(a[3]-1)*a[25]+a[75]) 