Obtuse Angle Decomposition#3673
Given a natural number .
Your task is to divide the set \{2, 3, 4, \ldots, 3n+1\} into triples such that each triple forms the sides of a non-degenerate obtuse triangle.
The input consists of a single line containing a natural number (1 \leq n \leq 30000).
Output exactly lines. On the -th line, write three numbers a_i, b_i, c_i separated by spaces, representing the sides of the -th triangle. If there are multiple solutions, you may output any of them. It is guaranteed that a solution always exists. Specifically, the output (a_1, b_1, c_1), \ldots, (a_n, b_n, c_n) will be correct if and only if the set \{a_1, b_1, c_1, \ldots, a_n, b_n, c_n\} is identical to \{2, 3, 4, \ldots, 3n+1\} and for each from to , the numbers a_i, b_i, c_i form a non-degenerate obtuse triangle. The order of numbers within each triple and the order of the triples themselves can be arbitrary.
Example 1