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: import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.StringTokenizer;
  import java.util.Arrays;
  import java.util.ArrayList;
  import java.util.Comparator;
  import java.util.HashMap;
  import java.util.HashSet;
  import java.util.TreeSet;
  import java.util.TreeMap;
  import java.util.PriorityQueue;
  
  import java.util.LinkedList;
  import java.util.Iterator;
  
  public class First {
  
      public static void main(String[] args) {
          FastScanner fs = new FastScanner();
          int T = fs.nextInt();
  
          for (int tt = 0; tt < T; tt++) {
  
              solve(fs);
          }
      }
      static void solve(FastScanner fs)
      {
          long x=fs.nextLong();
          if(x%2==1)
          {
              pn((x/2) + " "+(x/2+1));
          }
          else
          {
              long half=x/2;
              long m=2;
              while(half%2==0)
              {
                  half=half/2;
                  m*=2;
              }
              long r=m+half/2;
              long l=m-half/2;
              if(half==1)
              {
                  pn((-1*(x-1)) + " "+(x));
                  return;
              }
              pn((l) + " "+(r));
          }   
      }
      static int MOD=(int)(1e9+7);
      
      static long gcd(long a, long b) 
      {
          if (a == 0)
              return b;    
          return gcd(b%a, a);
      }
      static void pn(Object o) { System.out.println(o); } 
      static void p(Object o) { System.out.print(o); }
      static void flush() { System.out.flush(); }
  
      static void debugInt(int[] arr)
      {
          for(int i=0;i<arr.length;++i)
              System.out.print(arr[i]+" ");
          System.out.println();
      }
      static void debugIntInt(int[][] arr)
      {
          for(int i=0;i<arr.length;++i)
          {
              for(int j=0;j<arr[0].length;++j)
                  System.out.print(arr[i][j]+" ");
              System.out.println();
          }
          System.out.println();
      }
      static void debugLong(long[] arr)
      {
          for(int i=0;i<arr.length;++i)
              System.out.print(arr[i]+" ");
          System.out.println();
      }
      static void debugLongLong(long[][] arr)
      {
          for(int i=0;i<arr.length;++i)
          {
              for(int j=0;j<arr[0].length;++j)
                  System.out.print(arr[i][j]+" ");
              System.out.println();
          }
          System.out.println();
      }
      static long[] takeLong(int n, FastScanner fs)
      {
          long[] arr=new long[n];
          for(int i=0;i<n;++i)
              arr[i]=fs.nextLong();
          return arr;
      } 
      static long[][] takeLongLong(int m, int n, FastScanner fs)
      {
          long[][] arr=new long[m][n];
          for(int i=0;i<m;++i)
              for(int j=0;j<n;++j)
                  arr[i][j]=fs.nextLong();
          return arr;
      } 
      static int[] takeInt(int n, FastScanner fs)
      {
          int[] arr=new int[n];
          for(int i=0;i<n;++i)
              arr[i]=fs.nextInt();
          return arr;
      } 
      static int[][] takeIntInt(int m, int n, FastScanner fs)
      {
          int[][] arr=new int[m][n];
          for(int i=0;i<m;++i)
              for(int j=0;j<n;++j)
                  arr[i][j]=fs.nextInt();
          return arr;
      } 
      static class FastScanner {
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          StringTokenizer st = new StringTokenizer("");
          String next() {
              while (!st.hasMoreTokens())
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
          int[] readArray(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++) a[i] = nextInt();
              return a;
          }
          long nextLong() {
              return Long.parseLong(next());
          }
      }
  
  
  }
  class Pair
  {
      
  }