{"raw_statement":[{"iden":"problem statement","content":"AtCoder's head office consists of $N$ rooms numbered $1$ to $N$. For any two rooms, there is a direct passage connecting these rooms.\nFor security reasons, Takahashi the president asked you to set a **level** for every passage, which is a positive integer and must satisfy the following condition:\n\n*   For each room $i\\ (1 \\leq i \\leq N)$, if we leave Room $i$, pass through some passages whose levels are all equal and get back to Room $i$, the number of times we pass through a passage is always even.\n\nYour task is to set levels to the passages so that the highest level of a passage is minimized."},{"iden":"constraints","content":"*   $N$ is an integer between $2$ and $500$ (inclusive)."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"3"},{"iden":"sample output 1","content":"1 2\n1\n\nThe following image describes this output:\n![image](https://img.atcoder.jp/jsc2019-qual/D-sample.png)\nFor example, if we leave Room $2$, traverse the path $2 \\to 3 \\to 2 \\to 3 \\to 2 \\to 1 \\to 2$ while only passing passages of level $1$ and get back to Room $2$, we pass through a passage six times."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}