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.*;
  import java.util.*;
   
  public class a {
      FastScanner scn;
      PrintWriter w;
      PrintStream fs;
  
      long MOD = 1000000007;
      int N=100000+10;
      long mul(long x, long y) {long res = x * y; return (res >= MOD ? res % MOD : res);}
      long power(long x, long y) {if (y < 0) return 1; long res = 1; x %= MOD; while (y!=0) {if ((y & 1)==1)res = mul(res, x); y >>= 1; x = mul(x, x);} return res;}
      void ruffleSort(int[] a) {int n=a.length;Random r=new Random();for (int i=0; i<a.length; i++) {int oi=r.nextInt(n), temp=a[i];a[i]=a[oi];a[oi]=temp;}Arrays.sort(a);}
      boolean LOCAL;
      void debug(Object... o){if(LOCAL)System.err.println(Arrays.deepToString(o));}
      
      void solve(){
  
          int t=scn.nextInt();
              while(t-->0)
              {
                  long n=scn.nextLong();
                  if((n&1)!=0){
                      w.println(n/2+" "+((n/2)+1));
                  }else{
                      long op1=1-n;
                      w.println(op1+" "+n);
                  }
              
              
              }
          
      }
   
      void run() {
          try {
              long ct = System.currentTimeMillis();
              scn = new FastScanner(new File("input.txt"));
              w = new PrintWriter(new File("output.txt"));
              fs=new PrintStream("error.txt");
              System.setErr(fs);
              LOCAL=true;
   
              solve();
   
              w.close();
              System.err.println(System.currentTimeMillis() - ct);
          } catch (FileNotFoundException e) {
              e.printStackTrace();
          }
      }
   
      void runIO() {
   
          scn = new FastScanner(System.in);
          w = new PrintWriter(System.out);
          LOCAL=false;
   
          solve();
   
          w.close();
      }
   
      class FastScanner {
          BufferedReader br;
          StringTokenizer st;
   
          public FastScanner(File f) {
              try {
                  br = new BufferedReader(new FileReader(f));
              } catch (FileNotFoundException e) {
                  e.printStackTrace();
              }
          }
   
          public FastScanner(InputStream f) {
              br = new BufferedReader(new InputStreamReader(f));
          }
   
          String next() {
              while (st == null || !st.hasMoreTokens()) {
                  String s = null;
                  try {
                      s = br.readLine();
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
                  if (s == null)
                      return null;
                  st = new StringTokenizer(s);
              }
              return st.nextToken();
          }
   
          boolean hasMoreTokens() {
              while (st == null || !st.hasMoreTokens()) {
                  String s = null;
                  try {
                      s = br.readLine();
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
                  if (s == null)
                      return false;
                  st = new StringTokenizer(s);
              }
              return true;
          }
   
          int nextInt() {
              return Integer.parseInt(next());
          }
          
          int[] nextIntArray(int n) {
              int a[] = new int[n];
              for (int i = 0; i < n; i++) {
                  a[i] = nextInt();
              }
              return a;
          }
  
          long[] nextLongArray(int n) {
              long a[] = new long[n];
              for (int i = 0; i < n; i++) {
                  a[i] = nextLong();
              }
              return a;
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
   
          double nextDouble() {
              return Double.parseDouble(next());
          }
      }
   
      public static void main(String[] args) {
          new a().runIO();
      }
  }
  