{"problem":{"name":"Classified","description":{"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. For security reasons, Takahashi the president asked you to set a *","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"jsc2019_qual_d"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $N$ is an integer between $2$ and $500$ (inclusive).\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"jsc2019_qual_d","tags":[],"sample_group":[["3","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."]],"created_at":"2026-03-03 11:01:14"}}