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())
  primes = {}
  for p in map(
      int,
      "2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97".split(),
  ):
      primes[p] = 0
  factors = {}
  for p in primes.keys():
      factors[p] = 0
  for i in range(1, N + 1):
      while i > 1:
          for p in primes:
              while i % p == 0:
                  factors[p] = factors.get(p, 0) + 1
                  i //= p
  fact3, fact5, fact15, fact25, fact75 = 0, 0, 0, 0, 0
  for k, v in factors.items():
      if v >= 75:
          fact75 += 1
      if v >= 24:
          fact25 += 1
      if v >= 14:
          fact15 += 1
      if v >= 4:
          fact5 += 1
      if v >= 2:
          fact3 += 1
  print(
      fact75
      + fact25 * (fact3 - 1)
      + fact15 * (fact5 - 1)
      + fact5 * (fact5 - 1) * (fact3 - 2) // 2
  )
  
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"}]