Orlando, an employee of HIREDIVE, likes Rosalind but he did not propose her this valentine's week as he figured the proposal wont end up in his favour.

But now he cannot wait anymore. He believes a lot in destiny and he decides his proposal would depend on the famous rose petal game.

In a rose petal game, a person takes a rose of n petals and then pluck its petals 1 at a time. On alternate plucking, he chants "She loves me" and "She loves me not". And whatever he chants on plucking the last petal decides his fortune.

We denote "She loves me" by L and "She loves me not" by D respectively.

But as life isn't fair. He doesn't want to keep this fair and changes the plucking pattern to "DDLDLDDLDL...........DDLDL". He always starts with "She loves me not".

For example, if the number of petals is 4, then the plucking goes "DDLD", which ends in "She loves me not". If the number of petals is 5, the plucking goes "DDLDL".

He takes t roses, he wants you to find how many times he gets "She loves me" and "She loves me not" for all the t roses.

Input:

The first line contains a single integer t.
Each of the next t lines contains a single integer n denoting the number of petals.

Output:

If "x1" be the number of times he gets "She loves me" and
"x2" be the number of times he gets "She loves me not",
Print the result in this format - x1 x2

Constraints:

1<=t<=10^6
1<=n<=10^12