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())
  P = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]
  c = 0
  for i in range(15):
      a = n
      b = 0
      while a >= P[i]:
          a = a // P[i]
          b = b + a
      if b >= 74:
          c = c + 1
  for i in range(15):
      a = n
      b = 0
      while a >= P[i]:
          a = a // P[i]
          b = b + a
      if b >= 24:
          d = 0
          for j in range(15):
              if j == i:
                  continue
              a = n
              b = 0
              while a >= P[j]:
                  a = a // P[j]
                  b = b + a
              if b >= 2:
                  c = c + 1
  for i in range(15):
      a = n
      b = 0
      while a >= P[i]:
          a = a // P[i]
          b = b + a
      if b >= 14:
          d = 0
          for j in range(15):
              if j == i:
                  continue
              a = n
              b = 0
              while a >= P[j]:
                  a = a // P[j]
                  b = b + a
              if b >= 4:
                  c = c + 1
  for i in range(15):
      a = n
      b = 0
      while a >= P[i]:
          a = a // P[i]
          b = b + a
      if b >= 4:
          d = 0
          for j in range(i + 1, 15):
              if j == i:
                  continue
              a = n
              b = 0
              while a >= P[j]:
                  a = a // P[j]
                  b = b + a
              if b >= 4:
                  d = 0
                  for k in range(15):
                      if k == i or k == j:
                          continue
                      a = n
                      b = 0
                      while a >= P[k]:
                          a = a // P[k]
                          b = b + a
                      if b >= 2:
                          c = c + 1
  print(c)
  
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"}]