Consecutive Sum Riddle solution codeforces

Consecutive Sum Riddle solution codeforces

Theofanis has a riddle for you and if you manage to solve it, he will give you a Cypriot snack halloumi for free (Cypriot cheese).

You are given an integer n. You need to find two integers l and r such that 1018l<r1018 and l+(l+1)++(r1)+r=n.

Input

The first line contains a single integer t (1t104) — the number of test cases.

The first and only line of each test case contains a single integer n (1n1018).

Consecutive Sum Riddle solution codeforces

Output

For each test case, print the two integers l and r such that 1018l<r1018 and l+(l+1)++(r1)+r=n.

It can be proven that an answer always exists. If there are multiple answers, print any.

Example
input

Copy Consecutive Sum Riddle solution codeforces

7
1
2
3
6
100
25
3000000000000
output

Copy Consecutive Sum Riddle solution codeforces

0 1
-1 2 
1 2 
1 3 
18 22
-2 7
999999999999 1000000000001

Note Consecutive Sum Riddle solution codeforces

In the first test case, 0+1=1.

In the second test case, (1)+0+1+2=2.

In the fourth test case, 1+2+3=6.

In the fifth test case, 18+19+20+21+22=100.

In the sixth test case, (2)+(1)+0+1+2+3+4+5+6+7=25.

 

Leave a Reply

Your email address will not be published. Required fields are marked *

*