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: from math import sqrt
  
  
  def make_prime_list(n):
      if n < 2:
          return []
      numbers = [i for i in range(n)]
      numbers[1] = 0
      for number in numbers:
          if number > sqrt(n):
              break
          if number == 0:
              continue
          for non in range(2 * number, n, number):
              numbers[non] = 0
      return [number for number in numbers if number != 0]
  
  
  N = int(input())
  MOD = 10**9 + 7
  
  dictionary = {}
  primes = make_prime_list(N + 1)
  
  for prime in primes:
      dictionary[prime] = 0
      x = prime
      while x <= N:
          dictionary[prime] += N // x
          x *= prime
  
  answer = 1
  for value in dictionary.values():
      answer *= value + 1
      answer %= MOD
  print(answer)
  
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"}]