output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: n = int(input())
  m = 2
  z = 0
  
  for i in range(n - 2):
  
      def factorization(n):
          arr = []
          temp = n
          for i in range(2, int(-(-(n**0.5) // 1)) + 1):
              if temp % i == 0:
                  cnt = 0
                  while temp % i == 0:
                      cnt += 1
                      temp //= i
                  arr.append([i, cnt])
  
          if temp != 1:
              arr.append([temp, 1])
  
          if arr == []:
              arr.append([m, 1])
  
          return arr
  
      x = 0
      y = 1
  
      r = factorization(m)
      l = len(r)
  
      for i in range(l):
          y = y * (r[x][1] + 1)
          x += 1
  
      print(y)
  
      m += 1
      z = z + y
  
  print(z + 1)
  
problem_description: Statement
  
  Given is a positive integer N. How many tuples (A,B,C) of positive integers
  satisfy A \times B + C = N?
samples: [{"input": "3", "output": "3\n    \n\nThere are 3 tuples of integers that satisfy A \\times B + C = 3: (A, B, C) =\n(1, 1, 2), (1, 2, 1), (2, 1, 1).\n\n* * *"}, {"input": "100", "output": "473\n    \n\n* * *"}, {"input": "1000000", "output": "13969985"}]