Consecutive Sum

Given a positive integer n, determine whether it can be expressed as the sum of two or more consecutive positive integers. In other words, find a sequence of consecutive positive numbers a, a+1, \ldots, a+k-1 such that

\( n = a + (a+1) + \cdots + (a+k-1) = k \cdot a + \frac{k(k-1)}{2} \)

If such a sequence exists, output one valid sequence; otherwise, output an empty line.

Note: There may be multiple valid sequences. Your program only needs to output one of them.

inputFormat

The input consists of a single integer n (\(1 \le n \le 10^6\)). This value is provided via stdin.

outputFormat

If a valid sequence is found, output the consecutive numbers separated by a space on one line via stdout. If no such sequence exists, output an empty line.

## sample

9

4 5

</p>