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.*;
  import java.text.DecimalFormat;
  
  public class A {
      static long mod=(long)1e9+7;
      static long mod1=998244353;
      static InputStream inputStream = System.in;
      static OutputStream outputStream = System.out;
      static InputReader in = new InputReader(inputStream);
      static PrintWriter out = new PrintWriter(outputStream);
  
      public static void main(String[] args) throws IOException {
  
          int t= in.nextInt();
          while(t-->0) {
  
              long n = in.nextLong();
              out.println(-1*(n-1)+" "+n);
  
          }
          out.close();
      }
  
  
  
  
      static final Random random=new Random();
  
      static void ruffleSort(int[] a) {
          int n=a.length;//shuffle, then sort
          for (int i=0; i<n; i++) {
              int oi=random.nextInt(n), temp=a[oi];
              a[oi]=a[i]; a[i]=temp;
          }
          Arrays.sort(a);
      }
      static long gcd(long x, long y){
          if(x==0)
              return y;
          if(y==0)
              return x;
          long r=0, a, b;
          a = Math.max(x, y);
          b = Math.min(x, y);
          r = b;
          while(a % b != 0){
              r = a % b;
              a = b;
              b = r;
          }
          return r;
      }
      static long modulo(long a,long b,long c){
          long x=1,y=a%c;
          while(b > 0){
              if(b%2 == 1)
                  x=(x*y)%c;
              y = (y*y)%c;
              b = b>>1;
          }
          return  x%c;
      }
      public static void debug(Object... o){
          System.err.println(Arrays.deepToString(o));
      }
  
      static int upper_bound(int[] arr,int n,int x){
          int mid;
          int low=0;
          int high=n;
          while(low<high){
              mid=low+(high-low)/2;
              if(x>=arr[mid])
                  low=mid+1;
              else
                  high=mid;
          }
          return low;
      }
  
      static int lower_bound(int[] arr,int n,int x){
          int mid;
          int low=0;
          int high=n;
          while(low<high){
              mid=low+(high-low)/2;
              if(x<=arr[mid])
                  high=mid;
              else
                  low=mid+1;
          }
          return low;
      }
      static String printPrecision(double d){
          DecimalFormat ft = new DecimalFormat("0.00000000000");
          return String.valueOf(ft.format(d));
      }
      static int countBit(long mask){
          int ans=0;
          while(mask!=0){
              mask&=(mask-1);
              ans++;
          }
          return ans;
      }
  
      static class InputReader {
          public BufferedReader reader;
          public StringTokenizer tokenizer;
  
          public InputReader(InputStream stream) {
              reader = new BufferedReader(new InputStreamReader(stream), 32768);
              tokenizer = null;
          }
  
          public String next() {
              while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                  try {
                      tokenizer = new StringTokenizer(reader.readLine());
                  } catch (IOException e) {
                      throw new RuntimeException(e);
                  }
              }
              return tokenizer.nextToken();
          }
  
          public int nextInt() {
              return Integer.parseInt(next());
          }
  
          public long nextLong() {
              return Long.parseLong(next());
          }
  
          public double nextDouble() {
              return Double.parseDouble(next());
          }
  
          public int[] readArray(int n) {
              int[] arr = new int[n];
              for (int i = 0; i < n; i++) arr[i] = nextInt();
              return arr;
          }
      }
  }