{"raw_statement":[{"iden":"problem statement","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)$."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 10^5$"},{"iden":"input","content":"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 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."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}