CF1549A.Gregor and Cryptography

Gregor is learning about RSA cryptography, and although he doesn't understand how RSA works, he is now fascinated with prime numbers and factoring them.

Gregor's favorite prime number is $P$. Gregor wants to find two bases of $P$. Formally, Gregor is looking for two integers $a$ and $b$ which satisfy both of the following properties.

• $P \bmod a = P \bmod b$, where $x \bmod y$ denotes the remainder when $x$ is divided by $y$, and
• $2 \le a \lt b \le P$.

Help Gregor find two bases of his favorite prime number!

格雷戈尔正在学习 RSA 密码学，尽管他并不理解 RSA 的工作原理，但他现在对素数及其因式分解着了迷。

格雷戈尔最喜爱的素数是 $P$。他想为 $P$ 找到两个“底数”。形式化地说，格雷戈尔在寻找两个整数 $a$ 和 $b$，它们同时满足以下两个条件：

• $P \bmod a = P \bmod b$，其中 $x \bmod y$ 表示 $x$ 除以 $y$ 所得的余数；
• $2 \le a \lt b \le P$。

请帮助格雷戈尔找到他最喜爱的素数的两个底数！

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 1000$).

Each subsequent line contains the integer $P$ ($5 \le P \le {10}^9$), with $P$ guaranteed to be prime.

每个测试包含多个测试用例。第一行包含测试用例的数量 $t$（$1 \le t \le 1000$）。

随后的每一行包含一个整数 $P$（$5 \le P \le {10}^9$），且保证 $P$ 为质数。

Your output should consist of $t$ lines. Each line should consist of two integers $a$ and $b$ ($2 \le a \lt b \le P$). If there are multiple possible solutions, print any.

你的输出应包含 $t$ 行。每行应包含两个整数 $a$ 和 $b$（满足 $2 \le a \lt b \le P$）。若存在多个可行解，输出任意一个即可。

The first query is $P=17$. $a=3$ and $b=5$ are valid bases in this case, because $17 \bmod 3 = 17 \bmod 5 = 2$. There are other pairs which work as well.

In the second query, with $P=5$, the only solution is $a=2$ and $b=4$.

第一个查询中，$P=17$。此时 $a=3$ 和 $b=5$ 是有效的底数，因为 $17 \bmod 3 = 17 \bmod 5 = 2$。还存在其他满足条件的数对。

第二个查询中，当 $P=5$ 时，唯一解为 $a=2$ 和 $b=4$。