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.*;
  
  public class leetcode {
      public int shortestPath(int[][] grid, int k) {
          
          return 0;
          
      }
      
      static boolean isValid(int i, int j, int n, int m){
          if(i<0 || i==n || j<0 || j==m)return false;
          
          return true;
      }
      
      static int dp(int[][] g, int i, int j, int n, int m, int k){
          
          if(!isValid(i, j, n, m) || k<0 || g[i][j]==1){
              return 100000;   
          }
          
          if(i==n-1 && j==m-1)return 0;
          
          g[i][j]=1;
          
          int x=0,y=0,z=0,w=0;
          
           x=dp(g, i, j+1, n, m, k-1);
           y=dp(g, i+1, j, n, m, k-1);
           z=dp(g, i-1, j, n, m, k-1);
           w=dp(g, i, j-1, n, m, k-1);
          
          g[i][j]=0;
          
          return 1+Math.min( Math.min(x, y), Math.min(z, w) );
          
      }
  
  		 public static void main(String[] args) {
  			 
  			Scanner sc = new Scanner(System.in);
  			
  			int t = sc.nextInt();
  			
  			while(t-->0) {
  				
  				long n = sc.nextLong();
  				
  				System.out.println(-1*(n-1)+" "+n);
  				
  			}
  			 
  		 }
  		 
  }
  