require 'prime'

N = gets.to_i
def comb(n, r)
    f = [1]
    (1..n).each do |i|
        f << f[i - 1]*i
    end
    return f[n] / (f[r] * f[n - r])
end

factors = {}
(1..N).each do |n|
    primes = n.prime_division
    primes.each do |k, v|
        if factors.key?(k)
            factors[k] += v
        else
            factors[k] = v
        end
    end
end

ans = 0
candidate2 = 0
candidate4 = 0
candidate14 = 0
candidate24 = 0
candidate74 = 0

factors.each_value do |v|
    candidate2 += 1 if v >= 2    
    candidate4 += 1 if v >= 4    
    candidate14 += 1 if v >= 14    
    candidate24 += 1 if v >= 24    
    candidate74 += 1 if v >= 74    
end

# (74)
ans += candidate74

# (4, 14)
ans += candidate14 * (candidate4 - 1)

# (2, 24)
ans += candidate24 * (candidate2 - 1)

# (2, 4, 4)
ans += comb(candidate4, 2) * (candidate2 - 2) if candidate4 >= 2

puts ans