description: 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 -10^{18} ≤ l < r ≤ 10^{18} and l + (l + 1) + … + (r - 1) + r = n.
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
  
  The first and only line of each test case contains a single integer n (1 ≤ n ≤ 10^{18}).
  
  Output
  
  For each test case, print the two integers l and r such that -10^{18} ≤ l < r ≤ 10^{18} and l + (l + 1) + … + (r - 1) + r = n. 
  
  It can be proven that an answer always exists. If there are multiple answers, print any.
  
  Example
  
  Input
  
  
  7
  1
  2
  3
  6
  100
  25
  3000000000000
  
  
  Output
  
  
  0 1
  -1 2 
  1 2 
  1 3 
  18 22
  -2 7
  999999999999 1000000000001
  
  Note
  
  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.
solution: from collections import Counter, defaultdict, deque
  import bisect, heapq
  from sys import stdin, stdout
  from itertools import repeat
  import math
  
  
  def inp(force_list=False):
      re = map(int, raw_input().split())
      if len(re) == 1 and not force_list:
          return re[0]
      return re
  
  def inst():
      return raw_input().strip()
  
  def gcd(x, y):
     while(y):
         x, y = y, x % y
     return x
  
  mod = 998244353
  
  def qmod(a, b):
      res = 1
      while b:
          if b&1:
              res = (res*a)%mod
          b >>= 1
          a = (a*a)%mod
      return res
  
  def inv(a):
      return qmod(a, mod-2)
  
  
  def my_main():
      kase = inp()
      pans = []
      for ka in range(kase):
          # print 'Case #%d: ' % (ka+1),
          n = inp()
          pans.append("%d %d" % (-n+1, n))
  
      print '\n'.join(pans)
  
  my_main()
  