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: from collections import Counter
  
  
  def kaijou(value):
      sum_ = 1
      keep = []
      for v in range(1, value + 1):
          keep.append(count_element(v))
  
      # tmp = {}
      # for di in keep:
      #     dict(tmp, di)
      tmp = {}
      for di in keep:
          # print (di)
          tmp = Counter(tmp) + Counter(di)
      want = 1
      for i in tmp.values():
          want *= i + 1
      return int(want % 1000000007)
      # return tmp
  
  
  def count_element(value):
      max_value = value
      if value == 0:
          return {}
      min_value = 1
      element_count = 1
      hash_ = {}
      while max_value != 1:
          for v in range(min_value + 1, max_value + 1):
              count = 0
              while max_value % v == 0:
                  max_value = int(max_value / v)
                  count += 1
              if count == 0:
                  continue
              element_count *= count
              # print (element_count)
              min_value = v
              hash_[v] = element_count
              break
      return hash_
  
  
  if __name__ == "__main__":
      print(kaijou(int(input())))
  
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"}]