output_description: Print the number of the Shichi-Go numbers that are divisors of N!.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: N = int(input())
  
  prime_factorization = {}
  for i in range(1, N + 1):
      d = 2
      orig = i
      while d < (int(orig**0.5) + 1):
          while i % d == 0:
              i = i // d
              if d in prime_factorization:
                  prime_factorization[d] += 1
              else:
                  prime_factorization[d] = 1
          d += 1
      if i > 1:
          if i in prime_factorization:
              prime_factorization[i] += 1
          else:
              prime_factorization[i] = 1
  
  greater2 = 0
  greater4 = 0
  greater14 = 0
  greater24 = 0
  greater74 = 0
  for i in prime_factorization:
      if prime_factorization[i] >= 2:
          greater2 += 1
      if prime_factorization[i] >= 4:
          greater4 += 1
      if prime_factorization[i] >= 14:
          greater14 += 1
      if prime_factorization[i] >= 24:
          greater24 += 1
      if prime_factorization[i] >= 74:
          greater74 += 1
  combi3 = ((greater4 * (greater4 - 1)) // 2) * (greater2 - 2)
  combi2 = (greater14) * (greater4 - 1) + (greater24) * (greater2 - 1)
  combi1 = greater74
  print(combi1 + combi2 + combi3)
  
problem_description: Statement
  
  You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ...
  \times N), how many _Shichi-Go numbers_ (literally "Seven-Five numbers") are
  there?
  
  Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.
samples: [{"input": "9", "output": "0\n    \n\nThere are no Shichi-Go numbers among the divisors of 9! = 1 \\times 2 \\times\n... \\times 9 = 362880.\n\n* * *"}, {"input": "10", "output": "1\n    \n\nThere is one Shichi-Go number among the divisors of 10! = 3628800: 32400.\n\n* * *"}, {"input": "100", "output": "543"}]