description: Polycarp must pay exactly n burles at the checkout. He has coins of two nominal values: 1 burle and 2 burles. Polycarp likes both kinds of coins equally. So he doesn't want to pay with more coins of one type than with the other.
  
  Thus, Polycarp wants to minimize the difference between the count of coins of 1 burle and 2 burles being used. Help him by determining two non-negative integer values c_1 and c_2 which are the number of coins of 1 burle and 2 burles, respectively, so that the total value of that number of coins is exactly n (i. e. c_1 + 2 ⋅ c_2 = n), and the absolute value of the difference between c_1 and c_2 is as little as possible (i. e. you must minimize |c_1-c_2|).
  
  Input
  
  The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
  
  Each test case consists of one line. This line contains one integer n (1 ≤ n ≤ 10^9) — the number of burles to be paid by Polycarp.
  
  Output
  
  For each test case, output a separate line containing two integers c_1 and c_2 (c_1, c_2 ≥ 0) separated by a space where c_1 is the number of coins of 1 burle and c_2 is the number of coins of 2 burles. If there are multiple optimal solutions, print any one.
  
  Example
  
  Input
  
  
  6
  1000
  30
  1
  32
  1000000000
  5
  
  
  Output
  
  
  334 333
  10 10
  1 0
  10 11
  333333334 333333333
  1 2
  
  Note
  
  The answer for the first test case is "334 333". The sum of the nominal values of all coins is 334 ⋅ 1 + 333 ⋅ 2 = 1000, whereas |334 - 333| = 1. One can't get the better value because if |c_1 - c_2| = 0, then c_1 = c_2 and c_1 ⋅ 1 + c_1 ⋅ 2 = 1000, but then the value of c_1 isn't an integer.
  
  The answer for the second test case is "10 10". The sum of the nominal values is 10 ⋅ 1 + 10 ⋅ 2 = 30 and |10 - 10| = 0, whereas there's no number having an absolute value less than 0.
solution: import java.util.*;
  import java.lang.*;
  import java.io.*;
  
  
  public class cf2 {
      static PrintWriter out;
      static int MOD = 1000000007;
      static FastReader scan;
  
      /*-------- I/O using short named function ---------*/
      public static String ns() {
          return scan.next();
      }
  
      public static int ni() {
          return scan.nextInt();
      }
  
      public static long nl() {
          return scan.nextLong();
      }
  
      public static double nd() {
          return scan.nextDouble();
      }
  
      public static String nln() {
          return scan.nextLine();
      }
  
      public static void p(Object o) {
          out.print(o);
      }
  
      public static void ps(Object o) {
          out.print(o + " ");
      }
  
      public static void pn(Object o) {
          out.println(o);
      }
  
      /*-------- for output of an array ---------------------*/
      static void iPA(int arr[]) {
          StringBuilder output = new StringBuilder();
          for (int i = 0; i < arr.length; i++) output.append(arr[i] + " ");
          out.println(output);
      }
  
      static void lPA(long arr[]) {
          StringBuilder output = new StringBuilder();
          for (int i = 0; i < arr.length; i++) output.append(arr[i] + " ");
          out.println(output);
      }
  
      static void sPA(String arr[]) {
          StringBuilder output = new StringBuilder();
          for (int i = 0; i < arr.length; i++) output.append(arr[i] + " ");
          out.println(output);
      }
  
      static void dPA(double arr[]) {
          StringBuilder output = new StringBuilder();
          for (int i = 0; i < arr.length; i++) output.append(arr[i] + " ");
          out.println(output);
      }
  
      /*-------------- for input in an array ---------------------*/
      static void iIA(int arr[]) {
          for (int i = 0; i < arr.length; i++) arr[i] = ni();
      }
  
      static void lIA(long arr[]) {
          for (int i = 0; i < arr.length; i++) arr[i] = nl();
      }
  
      static void sIA(String arr[]) {
          for (int i = 0; i < arr.length; i++) arr[i] = ns();
      }
  
      static void dIA(double arr[]) {
          for (int i = 0; i < arr.length; i++) arr[i] = nd();
      }
  
      /*------------ for taking input faster ----------------*/
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
  
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          String next() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
          double nextDouble() {
              return Double.parseDouble(next());
          }
  
          String nextLine() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
  
      public static ArrayList<Integer> sieveOfEratosthenes(int n) {
          // Create a boolean array
          // "prime[0..n]" and
          // initialize all entries
          // it as true. A value in
          // prime[i] will finally be
          // false if i is Not a
          // prime, else true.
          boolean prime[] = new boolean[n + 1];
          for (int i = 0; i <= n; i++)
              prime[i] = true;
  
          for (int p = 2; p * p <= n; p++) {
              // If prime[p] is not changed, then it is a
              // prime
              if (prime[p] == true) {
                  // Update all multiples of p
                  for (int i = p * p; i <= n; i += p)
                      prime[i] = false;
              }
          }
          ArrayList<Integer> arr = new ArrayList<>();
          // Print all prime numbers
          for (int i = 2; i <= n; i++) {
              if (prime[i] == true)
                  arr.add(i);
          }
          return arr;
      }
  
      // Method to check if x is power of 2
      static boolean isPowerOfTwo(int x) {
          return x != 0 && ((x & (x - 1)) == 0);
      }
  
      //Method to return lcm of two numbers
      static int gcd(int a, int b) {
          return a == 0 ? b : gcd(b % a, a);
      }
  
      //Method to count digit of a number
      static int countDigit(long n) {
          String sex = Long.toString(n);
          return sex.length();
      }
  
      static void reverse(int a[]) {
          int i, k, t;
          int n = a.length;
          for (i = 0; i < n / 2; i++) {
              t = a[i];
              a[i] = a[n - i - 1];
              a[n - i - 1] = t;
          }
      }
      static long nCr(long n, long r)
      {
          return fact(n) / (fact(r) *
                  fact(n - r));
      }
  
      // Returns factorial of n
      static long fact(long n)
      {
          long res = 1;
          for (long i = 2; i <= n; i++)
              res = res * i;
          return res;
      }
      // Get all prime numbers till N using seive of Eratosthenes
      public static List<Integer> getPrimesTill(int n){
          boolean[] arr = new boolean[n+1];
          List<Integer> primes = new LinkedList<>();
          for(int i=2; i<=n; i++){
              if(!arr[i]){
                  primes.add(i);
                  for(long j=(i*i); j<=n; j+=i){
                      arr[(int)j] = true;
                  }
              }
          }
          return primes;
      }
  
      static final Random random = new Random();
  
      //Method for sorting
      static void ruffleSort(int[] arr) {
          int n = arr.length;
          for (int i = 0; i < n; i++) {
              int j = random.nextInt(n);
              int temp = arr[j];
              arr[j] = arr[i];
              arr[i] = temp;
          }
          Arrays.sort(arr);
      }
  
      static void sortadv(long[] a) {
          ArrayList<Long> l = new ArrayList<>();
          for (long value : a) {
              l.add(value);
          }
          Collections.sort(l);
          for (int i = 0; i < l.size(); i++)
              a[i] = l.get(i);
      }
  
      //Method for checking if a number is prime or not
      static boolean isPrime(int n) {
          if (n <= 1) return false;
          if (n <= 3) return true;
          if (n % 2 == 0 || n % 3 == 0) return false;
          for (int i = 5; i * i <= n; i = i + 6)
              if (n % i == 0 || n % (i + 2) == 0)
                  return false;
          return true;
      }
  
      public static void main(String[] args) throws java.lang.Exception {
          OutputStream outputStream = System.out;
          out = new PrintWriter(outputStream);
          scan = new FastReader();
          //for fast output sometimes
          StringBuilder sb = new StringBuilder();
          // prefix sum/dp , odd-even segregate , *brute force , 2 pointer , pattern
          // but first observe!
          int t = ni();
          while (t-- != 0) {
              int n=ni();
              int a=n/3;
              int rem=n%3;
              if(rem==0)
                  pn(a+" "+a);
              else if(rem==1)
                  pn((a+1)+" "+a);
              else
                  pn(a+" "+(a+1));
          }
          out.flush();
          out.close();
      }
  }
  