output_description: Print the number of the positive divisors of N!, modulo 10^9+7.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N
attempt: import math
  
  def prime_decomposition(n):
    i = 2
    table = []
    while i * i <= n:
      while n % i == 0:
        n = n // i
        table.append(i)
      i += 1
    if n > 1:
      table.append(n)
    return table
  
  
  n = int(input())
  n_kai = math.factorial(n)
  
  soin = prime_decomposition(n_kai)
  
  tmp = soin[0]
  counter = 0
  num_dict = {}
  
  forfor i in range(len(soin)):
  
      if soin[i] != tmp:
          tmp = soin[i]
          counter = 1
          if i+1 == len(soin):
              num_dict[tmp] = counter + 1
          else:
              if tmp != soin[i]:
                  num_dict[tmp] = counter + 1
      else:
          counter+=1
          num_dict[tmp] = counter + 1
  
  ans = 1
  for i in num_dict.values():
      ans *= i
  
  print(ans % (10**9 + 7))
  
problem_description: Statement
  
  You are given an integer N. Find the number of the positive divisors of N!,
  modulo 10^9+7.
samples: [{"input": "3", "output": "4\n    \n\nThere are four divisors of 3! =6: 1, 2, 3 and 6. Thus, the output should be 4.\n\n* * *"}, {"input": "6", "output": "30\n    \n\n* * *"}, {"input": "1000", "output": "972926972"}]