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.util.*;
  import java.io.*;
  import static java.lang.System.out;
  import java.util.Stack;
  import java.util.Queue;
  
  public class A1594
  {
  
      static int mod=(int)(1e9+7);
      static long MOD=(long)(1e9+7);
      static FastReader in=new FastReader();
      static PrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
          
      public static void main(String args[])
      {  
  
          int tc=1;
       
          tc=in.nextInt();
          tcloop: while(tc-->0)
          {
              long n=in.nextLong();
  
              
              pr.println((1-n)+" "+n);
            
              
            
  
          }
          pr.flush();
          
      }
  
  	static long gcd(long a,long b)
  	{
  		if(a==0)return b;
  		return gcd(b%a,a);
  	}
  
      static class Pair implements Comparable<Pair>
      {
          int a,b;
          Pair(int a,int b)
          {
              this.a=a;
              this.b=b;
  
          }
  
          @Override
          public int compareTo(Pair o)
          {
              return Integer.compare(a,o.a);
          }
      }
  
      
  
      static void sort(long[] a) {
  		ArrayList<Long> l = new ArrayList<>();
  		for (long i : a)
  			l.add(i);
  		Collections.sort(l);
  		for (int i = 0; i < a.length; i++)
  			a[i] = l.get(i);
  	}
      
      
  	static void sort(int[] a) {
  		ArrayList<Integer> l = new ArrayList<>();
  		for (int i : a)
  			l.add(i);
  		Collections.sort(l);
  		for (int i = 0; i < a.length; i++)
  			a[i] = l.get(i);
      }
  
      
      static class FastReader
      { 
          BufferedReader br; 
          StringTokenizer st; 
  
          public FastReader() 
          { 
              br = new BufferedReader(new InputStreamReader(System.in)); 
          } 
  
          String next() 
          { 
              while (st == null || !st.hasMoreElements()) 
              { 
                  try
                  { 
                      st = new StringTokenizer(br.readLine()); 
                  } 
                  catch (IOException  e) 
                  { 
                      e.printStackTrace(); 
                  } 
              } 
              return st.nextToken(); 
          } 
  
          int nextInt() 
          { 
              return Integer.parseInt(next()); 
          } 
  
          long nextLong() 
          { 
              return Long.parseLong(next()); 
          } 
  
          double nextDouble() 
          { 
              return Double.parseDouble(next()); 
          } 
          
          int[] readIntArray(int n)
          {
  		int a[]=new int[n];
  		for(int i=0;i<n;i++)a[i]=nextInt();
  		return a;
  	}
  		
  	long[] readLongArray(int n)
  	{
  		long a[]=new long[n];
  		for(int i=0;i<n;i++)a[i]=nextLong();
  		return a;
  	}
  	
          String nextLine() 
          { 
              String str = ""; 
              try
              { 
                  str = br.readLine(); 
              } 
              catch (IOException e) 
              { 
                  e.printStackTrace(); 
              } 
              return str; 
          } 
      } 
  }
  
  
  
  