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 解():
      iN = int(input())
      iD = 10**9 + 7
  
  
      if iN < 3:
          print(iN)
          exit()
  
      d素={2:1}
      for i in range(2,iN + 1):
          b素 = 1
          for j in range(2,int(i**0.5)+2):
              if i % j == 0:
                  b素 = 0
                  break
          if b素 :
              d素[i]=1
      for i in range(2,iN+1):
          for i素 in d素:
              while i % i素 == 0:
                  d素[i素]+=1
                  i //= i素
             if i == 0:
                  break
      iAns = 1
      for i素,num in d素.items():
          iAns *= num
          iAns %= iD
      print(iAns)
  解()
  
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"}]