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.io.BufferedReader;
  import java.io.FileReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.*;
  
  public class Main {
      public static void main(String[] args) throws IOException {
  
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in), 1024 * 1024 * 2);
          // br = new BufferedReader(new FileReader("src/codeforces/div3/_734/input.txt"), 1024 * 1024 * 2);
  
          int t = Integer.parseInt(br.readLine());
          StringBuilder sb = new StringBuilder();
  
          while (t-- > 0) {
  
              int n = Integer.parseInt(br.readLine());
              int[] r = a(n);
  
  
              sb.append(r[0]).append(' ').append(r[1]).append("\n");
  
  //            int[] sol = e(v);
  //            sb.append(sol.length).append('\n');
  //            for (int x : sol) {
  //                sb.append(x).append(" ");
  //            }
  //            sb.append('\n');
  
  //            int[] levels = new int[n];
  //            d(v, 0, n-1, 0, levels);
  //            for (int level: levels) {
  //                sb.append(level).append(" ");
  //            }
  //            sb.append('\n');
          }
  
          System.out.println(sb.toString());
      }
  
      static class Player {
          int v;
          int idx;
  
          public Player(int value, int index) {
              this.v = value;
              this.idx = index;
          }
      }
  
      public static long f(int[] v) {
  
          Map<Integer, Integer> m = new HashMap<>();
          for (int x : v) {
              m.put(x, m.getOrDefault(x, 0) + 1);
          }
  
          List<Integer> frecs = new ArrayList<>(m.values());
          frecs.sort(Comparator.comparingInt(x -> x));
  
          int p = frecs.size();
          int[] suffixSums = new int[p];
          suffixSums[p - 1] = frecs.get(p-1);
  
          for (int i = p - 2; i >= 0; i --) {
              suffixSums[i] = suffixSums[i+1] + frecs.get(i);
          }
  
          long min = Long.MAX_VALUE;
          long sum = 0;
          for (int i = 0; i < p ; i ++) {
              min = Math.min(min, sum + (suffixSums[i] - (long) (p - i) * frecs.get(i)));
              sum += frecs.get(i);
          }
  
          return min;
      }
  
      public static int[] e(int[] v) {
          List<Player> players = new ArrayList<>();
          for (int i = 0; i < v.length; i++) {
              players.add(new Player(v[i], i + 1));
          }
          players.sort(Comparator.comparingInt(o -> o.v));
  
          List<Player> winners = new ArrayList<>();
          long sum = 0;
          for (Player p : players) {
              if (p.v > sum) {
                  winners = new ArrayList<>();
              }
              winners.add(p);
              sum += p.v;
          }
  
          winners.sort(Comparator.comparingInt(o -> o.idx));
  
          return winners.stream().mapToInt(o -> o.idx).toArray();
      }
  
      public static void d(int[] v, int start, int end, int level, int[] levels) {
          if (start > end) {
              return;
          }
          int max = 0;
          int iMax = 0;
          for (int i = start; i <= end; i++) {
              if (v[i] > max) {
                  iMax = i;
                  max = v[i];
              }
          }
  
          levels[iMax] = level;
  
          if (iMax > start) {
              d(v, start, iMax - 1, level + 1, levels);
          }
          if (iMax < end) {
              d(v, iMax + 1, end, level + 1, levels);
          }
      }
  
  //    static class Node {
  //        Node left, right;
  //        int level;
  //        int value;
  //        int idx;
  //
  //        public Node(int curr, int pos) {
  //            this.value = curr;
  //            this.idx = pos;
  //        }
  //    }
  
  //    public static Node buildTree(int[] v, int pos) {
  //        if (pos > v.length) {
  //            return null;
  //        }
  //
  //
  //        int curr = v[pos];
  //        Node n = new Node(curr, pos);
  //        if (pos == v.length - 1) {
  //            return n;
  //        }
  //
  //        if ()
  //    }
  
      public static long[] cubes = new long[10_001];
  //    static {
  //        for (int i = 0 ; i < cubes.length; i++){
  //            cubes[i] = (long) i * i * i;
  //        }
  //    }
  
      public static boolean c(long x) {
          for (int i = 1; i < 10_001; i++) {
              if (i > x) {
                  return false;
              }
              long dif = x - cubes[i];
              if (Arrays.binarySearch(cubes, dif) > 0) {
                  return true;
              }
          }
          return false;
      }
  
      public static int b(int[] v) {
          int target = v.length / 3;
  
          int[] c = new int[3];
          for (int x : v) {
              c[x % 3]++;
          }
  
          int moves = 0;
  
          for (int i = 0; i < 3; i++) {
              if (c[i] < target) {
                  int needed = target - c[i];
                  int j = prevJ(i, 3);
                  int step = 1;
                  while (c[i] != target) {
                      if (c[j] > target) {
                          int surplus = c[j] - target;
                          if (surplus >= needed) {
                              c[i] = target;
                              c[j] -= needed;
                              moves += step * needed;
                          } else {
                              c[i] += surplus;
                              c[j] -= surplus;
                              moves += step * surplus;
                          }
                      }
                      j = prevJ(j, 3);
                      step++;
                  }
              }
          }
  
          return moves;
      }
  
      private static int prevJ(int j, int n) {
          return j == 0 ? n - 1 : j - 1;
      }
  
      public static int[] a(int n) {
          int c1 = n / 3;
          int c2 = c1;
  
          if (n % 3 == 1) {
              c1 ++;
          }
          if (n % 3 == 2) {
              c2++;
          }
  
          return new int[]{c1, c2};
      }
  
      public static int[] readArrayLine(String line, int n) {
          return readArrayLine(line, n, null, 0);
      }
  
      private static int[] readArrayLine(String line, int n, int array[], int pos) {
          int[] ret = array == null ? new int[n] : array;
          int start = 0;
          int end = line.indexOf(' ', start);
          for (int i = pos; i < pos + n; i++) {
              if (end > 0)
                  ret[i] = Integer.parseInt(line.substring(start, end));
              else
                  ret[i] = Integer.parseInt(line.substring(start));
              start = end + 1;
              end = line.indexOf(' ', start);
          }
          return ret;
      }
  }
  