时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld
题目描述
Walk Alone has a conjecture which says
He fails to prove it, so he wants you to prove it in a small range. Your work is to construct two integers
and 
such that
Any positive integer can be expressed as the difference between two positive integers with the same number of prime factors.
He fails to prove it, so he wants you to prove it in a small range. Your work is to construct two integers
-
.
-
输入描述:
The first line contains one integer, the number of test cases.
Each test case consists of only one line with an integer, denoting the number Walk Alone wants you to prove.
输出描述:
For each test case, print two integersin one line satisfying the constraints above.