Problem:
Score : 300 points

Problem 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.

Constraints

1≦N≦10^7

Partial Score

200 points will be awarded for passing the test set satisfying 1≦N≦1000.

Additional 100 points will be awarded for passing the test set without additional constraints.

Input

The input is given from Standard Input in the following format:

N

Output

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.

Sample Input 1

4

Sample Output 1

1
3

Solving only the 4-th problem will also result in the total score of 4 points, but solving the 1-st and 3-rd problems will lower the highest score of a solved problem.

Sample Input 2

7

Sample Output 2

1
2
4

The set \{3,4\} will also be accepted.

Sample Input 3

1

Sample Output 3

1

Solution in Haskell (GHC 7.10.3) (judge verdict: Accepted)

import Data.List

bsearch f (a,b)
    | a+1 == b = a
    | f m  = bsearch f (m,b)
    | otherwise = bsearch f (a,m)
    where m = a + (b-a)`div`2

main=do
    n<-readLn::IO Int
    let m = bsearch (\x->x^2+x < n*2) (0,n+1)
    putStr$unlines$map show$s ((m+1)*(m+2)`div`2 -n) [m+1,m..1]
    
s 0 r = r
s a (x:r)|a-x>=0 = s (a-x) r|a-x<0 = x : s a r