Problem Description

Little A has a pocket that can hold integers. He starts from $1$ and sequentially places each integer into the pocket in ascending order.

However, the pocket is limited in size, with a capacity of $n$. This means that the sum of all numbers in the pocket cannot exceed $n$.

Input Format

The input consists of a single line containing an integer, representing the integer $n$.

Output Format

Output several lines, each containing an integer, in ascending order, representing the numbers in the pocket.

Sample Input and Output

Sample Input #1

15

Sample Output #1

1
2
3
4
5

Sample Input #2

9

Sample Output #2

1
2
3

Notes

Data Range and Constraints

• For $40\%$ of the test cases, $n \leq 10^3$;
• For $100\%$ of the test cases, $1 \leq n \leq 10^9$.

见题面 Input 部分

见题面 Output 部分