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())
  ls = [1]
  ans = 0
  
  if N == 1:
          print(1)
  else:
      for i in range(1, N+1):
          new_ls = map(lambda x: x*i, ls)
          for j in new_ls    
              if j not in ls:
                  ans += 1
                  ls.append(j)
      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"}]