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: N = int(input())
  mod = pow(10, 9) + 7
  S = []
  A = [True] * (N + 1)
  A[0] = A[1] = False
  for i in range(2, N + 1):
      if A[i]:
          S.append(i)
          A[i::i] = [False] * (N // i)
  B = [1] * (N + 1)
  for i in range(2, N + 1):
      n = i
      for s in S:
          while n % s == 0:
              B[s] += 1
              n //= s
  ans = 1
  for b in B:
      ans *= b
  print(ans % mod)
  
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"}]