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())
  p=[0 for i in range(10000)]
  p[0]=0
  p[1]=0
  for i in range(2,n+1):
    if p[i]==1:
    	for j in range(i*i,n+1,i):
        p[j]=0
  ans=1
  for i in range(2,n+1):
    if p[i]:
      c=0
      k=i
      while n//k>0:
        c=c+(n//k)%m
        k=k*k
      ans=(ans*((c+1)%m))%m
  print(ans)
      
      
        
        
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"}]