CF1765M.Minimum LCM

传统题 时间 2000 ms 内存 256 MiB 5 尝试 1 已通过 1 标签

Minimum LCM

You are given an integer nn.

Your task is to find two positive (greater than 00) integers aa and bb such that a+b=na+b=n and the least common multiple (LCM) of aa and bb is the minimum among all possible values of aa and bb. If there are multiple answers, you can print any of them.

Input

The first line contains a single integer tt (1t1001 \le t \le 100) — the number of test cases.

The first line of each test case contains a single integer nn (2n1092 \le n \le 10^9).

Output

For each test case, print two positive integers aa and bb — the answer to the problem. If there are multiple answers, you can print any of them.

Note

In the second example, there are 88 possible pairs of aa and bb:

  • a=1a = 1, b=8b = 8, LCM(1,8)=8LCM(1, 8) = 8;
  • a=2a = 2, b=7b = 7, LCM(2,7)=14LCM(2, 7) = 14;
  • a=3a = 3, b=6b = 6, LCM(3,6)=6LCM(3, 6) = 6;
  • a=4a = 4, b=5b = 5, LCM(4,5)=20LCM(4, 5) = 20;
  • a=5a = 5, b=4b = 4, LCM(5,4)=20LCM(5, 4) = 20;
  • a=6a = 6, b=3b = 3, LCM(6,3)=6LCM(6, 3) = 6;
  • a=7a = 7, b=2b = 2, LCM(7,2)=14LCM(7, 2) = 14;
  • a=8a = 8, b=1b = 1, LCM(8,1)=8LCM(8, 1) = 8.

In the third example, there are 55 possible pairs of aa and bb:

  • a=1a = 1, b=4b = 4, LCM(1,4)=4LCM(1, 4) = 4;
  • a=2a = 2, b=3b = 3, LCM(2,3)=6LCM(2, 3) = 6;
  • a=3a = 3, b=2b = 2, LCM(3,2)=6LCM(3, 2) = 6;
  • a=4a = 4, b=1b = 1, LCM(4,1)=4LCM(4, 1) = 4.

Samples

4
2
9
5
10
1 1
3 6
1 4
5 5

在线编程 IDE

建议全屏模式获得最佳体验