# 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 . You need to find two integers  and  such that  and .

Input

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

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

## Consecutive Sum Riddle solution codeforces

Output

For each test case, print the two integers  and  such that  and .

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, .

In the second test case, .

In the fourth test case, .

In the fifth test case, .

In the sixth test case, .