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: def get_prime_factorized(N):
      R = []
      b, e = 2, 0
      while b**2 <= N:
          while N % b == 0:
              N = N // b
              e += 1
          if e > 0:
              R.append([b, e])
          b, e = b + 1, 0
      if N > 1:
          R.append([N, 1])
      return R
  
  
  N = int(input())
  H = {}
  R = 1
  
  for n in range(1, N + 1):
      for l in get_prime_factorized(n):
          k, c = l
          if k in H.keys():
              H[k] += c
          else:
              H[k] = c
  
  for k in H.keys():
      R *= H[k] + 1
      R %= 10**9 + 7
  
  print(R)
  
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"}]