{"raw_statement":[{"iden":"problem statement","content":"The problem set at _CODE FESTIVAL 20XX Finals_ consists of $N$ problems.\nThe score allocated to the $i$\\-th $(1≦i≦N)$ problem is $i$ points.\nTakahashi, a contestant, is trying to score exactly $N$ points. For that, he is deciding which problems to solve.\nAs problems with higher scores are harder, he wants to minimize the highest score of a problem among the ones solved by him.\nDetermine the set of problems that should be solved."},{"iden":"constraints","content":"*   $1≦N≦10^7$"},{"iden":"partial score","content":"*   $200$ points will be awarded for passing the test set satisfying $1≦N≦1000$.\n*   Additional $100$ points will be awarded for passing the test set without additional constraints."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"4"},{"iden":"sample output 1","content":"1\n3\n\nSolving 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."},{"iden":"sample input 2","content":"7"},{"iden":"sample output 2","content":"1\n2\n4\n\nThe set ${3,4}$ will also be accepted."},{"iden":"sample input 3","content":"1"},{"iden":"sample output 3","content":"1"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}