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: import numpy as np
  
  
  def main():
      n = int(input())
      sosuu = []
      sosuucount = []
  
      for i in range(2, n + 1):
          num = i
          sosuuf = 1
  
          for j in range(len(sosuu)):
              if num % sosuu[j] == 0:
                  sosuuf = 0
                  while num % sosuu[j] == 0:
                      num /= sosuu[j]
                      sosuucount[j] += 1
          if sosuuf == 1:
              sosuu.append(num)
              sosuucount.append(1)
      num75 = 0
      num25 = 0
      num15 = 0
      num5 = 0
      num3 = 0
      for i in range(len(sosuu)):
          if sosuucount[i] + 1 >= 75:
              num75 += 1
          if sosuucount[i] + 1 >= 25:
              num25 += 1
          if sosuucount[i] + 1 >= 15:
              num15 += 1
          if sosuucount[i] + 1 >= 5:
              num5 += 1
          if sosuucount[i] + 1 >= 3:
              num3 += 1
      r = (
          num75
          + num25 * (num3 - 1)
          + num15 * (num5 - 1)
          + num5 * (num5 - 1) * (num3 - 2) / 2
      )
  
      print(int(r))
  
      # print(sosuu)
      # print(sosuucount)
      # print(num3, num5, num15, num25, num75)
  
  
  main()
  
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"}]