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.IOException;
  
      import java.io.IOException;
      import java.io.InputStream;
      import java.io.PrintWriter;
      import java.math.BigInteger;
      import java.util.InputMismatchException;
  
      public class ConsecutiveSumRiddle {
          static InputReader inputReader=new InputReader(System.in);
          static void solve()
          {
  
              long no=inputReader.nextLong();
              out.println(-no+1+" "+no);
          }
          static PrintWriter out=new PrintWriter((System.out));
          public static void main(String args[])throws IOException
          {
              int t=inputReader.nextInt();
              while(t-->0)
              {
                  solve();
              }
              out.close();
          }
          static class InputReader {
  
              private InputStream stream;
              private byte[] buf = new byte[8192];
              private int curChar, snumChars;
              private SpaceCharFilter filter;
  
              public InputReader(InputStream stream) {
                  this.stream = stream;
              }
  
              public int snext() {
                  if (snumChars == -1)
                      throw new InputMismatchException();
                  if (curChar >= snumChars) {
                      curChar = 0;
                      try {
                          snumChars = stream.read(buf);
                      } catch (IOException e) {
                          throw new InputMismatchException();
                      }
                      if (snumChars <= 0)
                          return -1;
                  }
                  return buf[curChar++];
              }
  
              public int nextInt() {
                  int c = snext();
                  while (isSpaceChar(c))
                      c = snext();
                  int sgn = 1;
                  if (c == '-') {
                      sgn = -1;
                      c = snext();
                  }
                  int res = 0;
                  do {
                      if (c < '0' || c > '9')
                          throw new InputMismatchException();
                      res *= 10;
                      res += c - '0';
                      c = snext();
                  } while (!isSpaceChar(c));
                  return res * sgn;
              }
  
              public long nextLong() {
                  int c = snext();
                  while (isSpaceChar(c))
                      c = snext();
                  int sgn = 1;
                  if (c == '-') {
                      sgn = -1;
                      c = snext();
                  }
                  long res = 0;
                  do {
                      if (c < '0' || c > '9')
                          throw new InputMismatchException();
                      res *= 10;
                      res += c - '0';
                      c = snext();
                  } while (!isSpaceChar(c));
                  return res * sgn;
              }
  
              public int[] nextIntArray(int n) {
                  int a[] = new int[n];
                  for (int i = 0; i < n; i++)
                      a[i] = nextInt();
                  return a;
              }
  
              public String readString() {
                  int c = snext();
                  while (isSpaceChar(c))
                      c = snext();
                  StringBuilder res = new StringBuilder();
                  do {
                      res.appendCodePoint(c);
                      c = snext();
                  } while (!isSpaceChar(c));
                  return res.toString();
              }
  
              public boolean isSpaceChar(int c) {
                  if (filter != null)
                      return filter.isSpaceChar(c);
                  return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
              }
  
              public interface SpaceCharFilter {
                  public boolean isSpaceChar(int ch);
              }
          }
      }
  