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.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.StringTokenizer;
  
  public class Main {
  
      void solve() throws IOException {
          int t = readInt();
          for (int i = 0; i < t; i++) {
              long n = readLong();
              out.print(-(n - 1) + " " + n + "\n");
          }
  
      }
  
      BufferedReader in;
      PrintWriter out;
      StringTokenizer tokenizer;
      final String delimiter = " ";
  
      public static void main(String[] args) {
          try {
              new Main();
          } catch (IOException e) {
              e.printStackTrace();
          }
      }
  
      int readInt() throws IOException {
          return Integer.parseInt(readString());
      }
  
      long readLong() throws IOException {
          return Long.parseLong(readString());
      }
  
      String readString() throws IOException {
          if (tokenizer == null || !tokenizer.hasMoreTokens()) {
              tokenizer = new StringTokenizer(in.readLine(), delimiter);
          }
          if (tokenizer.hasMoreTokens()) {
              return tokenizer.nextToken();
          } else {
              return null;
          }
      }
  
      int[] readIntArray(int n) throws IOException {
          int[] res = new int[n];
          for (int i = 0; i < n; i++) {
              res[i] = readInt();
          }
          return res;
      }
  
      Main() throws IOException {
          in = new BufferedReader(new InputStreamReader(System.in));
          out = new PrintWriter(System.out);
          solve();
          out.close();
      }
  }