{"raw_statement":[{"iden":"problem statement","content":"You are given a positive integer $N$. A set $S$ of positive integers between $1$ and $N$ (inclusive) is called a **good set** if it satisfies the following condition:\n\n*   For every pair of elements $x$ and $y$ in $S$, the remainder when $x$ is divided by $y$ is not $1$.\n\nConstruct one good set with the maximum possible number of elements."},{"iden":"constraints","content":"*   $1 \\le N \\le 2 \\times 10^{5}$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"5"},{"iden":"sample output 1","content":"2\n3 5\n\nFor example, $\\lbrace 3,5 \\rbrace$ and $\\lbrace 2 \\rbrace$ are good sets. On the other hand, $\\lbrace 2,3,5 \\rbrace$ and $\\lbrace 1,2,3,4,5 \\rbrace$ are not good sets.\nNo good set with three or more elements exists, so $\\lbrace 3,5 \\rbrace$ is one of the good sets with the maximum number of elements."},{"iden":"sample input 2","content":"2"},{"iden":"sample output 2","content":"1\n2"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}