As a student of the applied mathematics school of UESTC, WCM likes mathematics. Some day he found an interesting theorem that every positive integer¡¯s cube can be expressed as the sum of some continuous odd positive integers. For example, 11*11*11 = 1331 = 111+113+115+117+119+121+123+125+127+129+131 Facing such a perfect theorem, WCM felt very agitated. But he didn¡¯t know how to prove it. He asked his good friend Tom Riddle for help. Tom Riddle is a student of the computer science school of UESTC and is skillful at programming. He used the computer to prove the theorem¡¯s validity easily. Can you also do it? Given a positive integer N, you should determine how to express this number as the sum of N continuous odd positive integers. You only need to output the smallest and the largest number among the N integers. Input The input contains an integer on the first line, which indicates the number of test cases. Each test case contains one positive integer N on a single line(0 < N <= 1000). Output For each test case, output two integers on a line, the smallest and the largest number among the N continuous odd positive integers whose sum is N*N*N. Sample Input 2 11 3 Sample Output 111 131 7 11 Source UESTC 5th programming contest