{"raw_statement":[{"iden":"statement","content":"After destroying half of all life in the universe, Thanos decides to destroy one-third of all positive integers in the universe. Thanos starts by destroying 0, and then proceeds to destroy any positive integers that are a multiple of 3.\n\nYour task is to find the first $n$ integers that are left (have not been destroyed) after Thanos applies this operation. For example, the first 5 integers that are left are 1, 2, 4, 5, and 7.\n\nThe only line of input consists of a single positive integer $n$: the number of integers to print.\n\nOutput $n$ lines: the first $n$ integers that were not destroyed by Thanos.\n\n"},{"iden":"input","content":"The only line of input consists of a single positive integer $n$: the number of integers to print."},{"iden":"output","content":"Output $n$ lines: the first $n$ integers that were not destroyed by Thanos."},{"iden":"examples","content":"Input5\nOutput1\n2\n4\n5\n7\nInput11\nOutput1\n2\n4\n5\n7\n8\n10\n11\n13\n14\n16\nInput3\nOutput1\n2\n4\n"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ n \\in \\mathbb{Z}^+ $ be the number of surviving integers to output.  \nLet $ D = \\{ 3k \\mid k \\in \\mathbb{Z}_{\\geq 0} \\} $ be the set of destroyed integers.  \nLet $ S = \\mathbb{Z}^+ \\setminus D $ be the set of surviving positive integers.\n\n**Constraints**  \n$ 1 \\leq n \\leq \\text{large enough to ensure at least } n \\text{ survivors} $\n\n**Objective**  \nOutput the first $ n $ elements of $ S $ in increasing order:  \n$$ \\min^{(1)}(S), \\min^{(2)}(S), \\dots, \\min^{(n)}(S) $$  \nwhere $ \\min^{(k)}(S) $ denotes the $ k $-th smallest element of $ S $.","simple_statement":"Print the first n positive integers that are not divisible by 3.","has_page_source":false}