{"problem":{"name":"ℕ Coloring","description":{"content":"Given is an integer $N$. Among the sequences of $N$ positive integers $A_1, A_2, \\ldots, A_N$ satisfying the following condition, print one that minimizes the maximum value in the sequence. *   If $i","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc115_c"},"statements":[{"statement_type":"Markdown","content":"Given is an integer $N$. Among the sequences of $N$ positive integers $A_1, A_2, \\ldots, A_N$ satisfying the following condition, print one that minimizes the maximum value in the sequence.\n\n*   If $i$ divides $j$, $A_i \\neq A_j$ $(1 \\leq i < j \\leq N)$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 10^5$\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":"arc115_c","tags":[],"sample_group":[["4","1 2 2 3\n\nThis solution satisfies all of the following conditions:\n\n*   $A_1 \\neq A_2$\n*   $A_1 \\neq A_3$\n*   $A_1 \\neq A_4$\n*   $A_2 \\neq A_4$\n\nAdditionally, there is no sequence satisfying these conditions where the maximum value in the sequence is $2$ or less, so this is a valid solution."]],"created_at":"2026-03-03 11:01:14"}}