G. Mario's Cheesy Tuna Pit Stop (Grey)
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

During a brief break from racing, Mario is making $$$n$$$ delicious tuna sandwiches.

Each sandwich requires exactly two slices of cheese. There are two types of cheese available: Mushroom Cheese and Star Cheese.

Mario follows a specific, repeating pattern for the cheese slices in his sandwiches:

  • The first sandwich uses two slices of Mushroom Cheese (Mushroom Cheese, Mushroom Cheese).
  • The second sandwich uses one slice of Mushroom Cheese and one slice of Star Cheese (Mushroom Cheese, Star Cheese).
  • The third sandwich uses two slices of Star Cheese (Star Cheese, Star Cheese).
This pattern repeats for all subsequent sandwiches (the 4th sandwich is like the 1st, the 5th like the 2nd, and so on).
Mario Kart Sandwich.

Mario wants to make $$$n$$$ sandwiches, determine the total number of Mushroom Cheese slices and the total number of Star Cheese slices he will need.

Input

The first line contains a single integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases.

The only line of each test case contain a single integer $$$n$$$ ($$$3 \le n \le 10^9$$$) — representing the total number of sandwiches.

Output

Output $$$t$$$ lines each line contain two space-separated integers: the total number of Mushroom Cheese slices followed by the total number of Star Cheese slices required.

Example
Input
2
3
8
Output
3 3
9 7