output_description: Among the sets of problems with the total score of N, find a set in which the
  highest score of a problem is minimum, then print the indices of the problems
  in the set in any order, one per line.
  
  If there exists more than one such set, any of them will be accepted.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N
attempt: n = int(input())
  now = 1
  L = []
  while now * (now - 1) // 2 < n:
      L.append(now)
      now += 1
  c = sum(L)
  if c > n:
      L.remove(c - n)
  print(*L, sep="\n")
  
problem_description: Statement
  
  The problem set at _CODE FESTIVAL 20XX Finals_ consists of N problems.
  
  The score allocated to the i-th (1≦i≦N) problem is i points.
  
  Takahashi, a contestant, is trying to score exactly N points. For that, he is
  deciding which problems to solve.
  
  As problems with higher scores are harder, he wants to minimize the highest
  score of a problem among the ones solved by him.
  
  Determine the set of problems that should be solved.
samples: [{"input": "4", "output": "1\n    3\n    \n\nSolving only the 4-th problem will also result in the total score of 4 points,\nbut solving the 1-st and 3-rd problems will lower the highest score of a\nsolved problem.\n\n* * *"}, {"input": "7", "output": "1\n    2\n    4\n    \n\nThe set \\\\{3,4\\\\} will also be accepted.\n\n* * *"}, {"input": "1", "output": "1"}]