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: # -*- coding:utf-8 -*-
  import math
  import sys
  
  def mark(s, x):
      for i in range(x + x, len(s), x):
          s[i] = False
  
  def sieve(n):
      s = [True] * n
      for x in range(2, int(n**0.5) + 1):
          if s[x]: mark(s, x)
      return [i for i in range(0,n) if s[i] and i > 1]
  
  n = int(input())
  p = sieve(n)
  arr = [0]*len(p)
  n = math.factorial(n)
  
  for i in range(len(p)):
      flag = 1
      k = p[i]
      while flag:
          if n%k == 0:
              k = k*p[i]
              arr[i] += 1
          else:
              flag = 0
  
  x = 1
  for i in range(len(arr)):
      if arr[i] != 0:
          x *= (arr[i]+1)
  if ( n = 6):
      print(4)
  else:
      print(x%(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"}]