CF753A.Santa Claus and Candies

Santa Claus has n candies, he dreams to give them as gifts to children.

What is the maximal number of children for whose he can give candies if Santa Claus want each kid should get distinct positive integer number of candies. Santa Class wants to give all n candies he has.

圣诞老人有 $n$ 颗糖果，他梦想把这些糖果作为礼物送给孩子们。

如果圣诞老人希望每个孩子得到的糖果数量均为互不相同的正整数，并且他必须恰好送完全部 $n$ 颗糖果，那么他最多能送给多少个孩子？

The only line contains positive integer number n (1 ≤ n ≤ 1000) — number of candies Santa Claus has.

唯一一行包含一个正整数 $ n $（$ 1 \leq n \leq 1000 $）——圣诞老人拥有的糖果数量。

Print to the first line integer number k — maximal number of kids which can get candies.

Print to the second line k distinct integer numbers: number of candies for each of k kid. The sum of k printed numbers should be exactly n.

If there are many solutions, print any of them.

第一行输出整数 k —— 能够分到糖果的孩子的最大人数。

第二行输出 k 个互不相同的整数：每个孩子分到的糖果数量。这 k 个数的和必须恰好为 n。

若存在多种解，输出任意一种即可。