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: import sys
  
  def main():
      N = input()
      N = int(N)
  
      k = 1
      s = []
      #lst = list(range(1,N+1))
      primes = prime(N)
      num = len(primes)
  
      # N=1
      lst = [0] * N
      if N ==1:
          print(1)
          exit()
  
      # N>=2
      for i in range(2,N+1):
          b =[]
          b = bunkai(i)
          for i in b:
              lst[primes.index(i)] += 1
  
      ans = 1
      for i in lst:
          if i is not 0:
              ans = ans * (i+1)
      print(ans%1000000007)
  
  
  def prime(n):
      primes = []
      for i in range(2,n):
          flag = True
          for j in range(2,i):
              if i%j == 0:
                  flag = False
          if flag:
              primes.append(i)
      return primes
  
  def bunkai(i):
      bunkai =[]
      s =0
      while s ==0:
          for j in range(2,i+1):
              if i % j ==0:
                  bunkai.append(j)
                  i = int(i/j)
                  if i ==1:
                     s=1
                  break
      return bunkai
  
  if __name__ == "__main__":
          main()
  shunki@ ~/scripts/python/atcoder/abc/abc_000 $ vim c.py
  shunki@ ~/scripts/python/atcoder/abc/abc_000 $ python c.py
  2
  2
  shunki@ ~/scripts/python/atcoder/abc/abc_000 $ python c.py
  3
  4
  shunki@ ~/scripts/python/atcoder/abc/abc_000 $ cat c.py
  import sys
  
  def main():
      N = input()
      N = int(N)
  
      k = 1
      s = []
      #lst = list(range(1,N+1))
      primes = prime(N+1)
      num = len(primes)
  
      # N=1
      lst = [0] * N
      if N ==1:
          print(1)
          exit()
  
      # N>=2
      for i in range(2,N+1):
          b =[]
          b = bunkai(i)
          for i in b:
              lst[primes.index(i)] += 1
  
      ans = 1
      for i in lst:
          if i is not 0:
              ans = ans * (i+1)
      print(ans%1000000007)
  
  
  def prime(n):
      primes = []
      for i in range(2,n):
          flag = True
          for j in range(2,i):
              if i%j == 0:
                  flag = False
          if flag:
              primes.append(i)
      return primes
  
  def bunkai(i):
      bunkai =[]
      s =0
      while s ==0:
          for j in range(2,i+1):
              if i % j ==0:
                  bunkai.append(j)
                  i = int(i/j)
                  if i ==1:
                     s=1
                  break
      return bunkai
  
  if __name__ == "__main__":
          main()
  
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"}]