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: from math import factorial
  from itertools import product
  
  
  def get_divisors(n):
      div = []
      append = div.append
      for i in range(1, int(n**0.5) + 1):
          if n % i == 0:
              append(i)
              if i != n // i:
                  append(n // i)
      div.sort()
      return div
  
  
  # input
  N = int(input())
  N_fact = factorial(N)
  
  if N_fact < 357:
      print(0)
  else:
      Nf_dig = len(str(N_fact))
      divisors = get_divisors(N_fact)
      dig = 3
      sgs_nuns = []
      sgs = ["7", "5", "3"]
      set_sgs = set(sgs)
      str_join = "".join
      for n in range(3, Nf_dig + 1):
          sgs_nuns += [
              str_join(n)
              for n in product(["7", "5", "3"], repeat=n)
              if set(str_join(n)) == set_sgs and int(str_join(n)) in divisors
          ]
  
      cnt = len(sgs_nuns)
      print(cnt)
  
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"}]