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.*;
  import java.util.*;
  public class ProblemA{
      static int t,n;
      static int[] arr;
      static StringBuilder ans=new StringBuilder();
      static long mod=1000000007l;
      static int max=Integer.MAX_VALUE,min=Integer.MIN_VALUE;
      static long maxl=Long.MAX_VALUE,minl=Long.MIN_VALUE;
      static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
      static StringTokenizer st;
    
      public static void main(String[] args) throws IOException{
          st=new StringTokenizer(br.readLine());
          int t=i();
          StringBuilder sb=new StringBuilder();
          o:
          while(t-->0)
          {
              long n=l();
              long cnt=n/3;
              long op1=n-cnt*2;
              long op2=cnt;
              // sb.append(n-cnt*2).append(" ").append(cnt);
              if(op1>=op2+2){
              	sb.append(op1-2).append(" ").append(op2+1);
              }else{
              	sb.append(op1).append(" ").append(op2);
              }
              
              if(t!=0)
                sb.append("\n");
          }
          p(sb);
      }
      static int max(int a,int b){return a>b?a:b;}
      static int min(int a,int b){return a<b?a:b;}
      static int abs(int a){return Math.abs(a);}
      static long max(long a,long b){return a>b?a:b;}
      static long min(long a,long b){return a<b?a:b;}
      static long abs(long a){return Math.abs(a);}
      static int sq(int a){return (int)Math.sqrt(a);}
      static long sq(long a){return (long)Math.sqrt(a);}
      static long gcd(long a,long b){return b==0l?a:gcd(b,a%b);}
      static int fib(int n){return (int)Math.round(Math.pow((1+sq(5))/2,n)/sq(5));}
  
      static int[] fac(int n)
      {
          int bo[]=new int[n+1];
          for(int x=1;x<=n;x++)for(int y=x;y<=n;y+=x)bo[y]++;
          return bo;
      }
      static long fastPow(long x,long pow){
          if(pow==0){
              return 1;
          }
          if((pow&1)==1){
              return (x*fastPow((x*x)%mod,pow/2))%mod;
          }
          else{
              return fastPow((x*x)%mod,pow/2)%mod;
          }
      }
      static long div(long a,long b,long m)
      {
          long r=1l;
          a%=m;
          while(b>0)
          {
              if((b&1)==1)r=(r*a)%m;
              b>>=1;
              a=(a*a)%m;
          }
          return r;
      }
      static int i()throws IOException
      {
          if(!st.hasMoreTokens()) st=new StringTokenizer(br.readLine());
          return Integer.parseInt(st.nextToken());
      }
      static long l()throws IOException
      {
          if(!st.hasMoreTokens())st=new StringTokenizer(br.readLine());
          return Long.parseLong(st.nextToken());
      }
      static String s()throws IOException
      {
          if(!st.hasMoreTokens())st=new StringTokenizer(br.readLine());
          return st.nextToken();
      }
      static double d()throws IOException
      {
          if(!st.hasMoreTokens())st=new StringTokenizer(br.readLine());
          return Double.parseDouble(st.nextToken());
      }
      static void p(Object p){System.out.print(p);}
      static void p(String p){System.out.print(p);}
      static void p(int p){System.out.print(p);}
      static void p(double p){System.out.print(p);}
      static void p(long p){System.out.print(p);}
      static void p(char p){System.out.print(p);}
      static void p(boolean p){System.out.print(p);}
      static void pl(Object p){System.out.println(p);}
      static void pl(String p){System.out.println(p);}
      static void pl(int p){System.out.println(p);}
      static void pl(char p){System.out.println(p);}
      static void pl(double p){System.out.println(p);}
      static void pl(long p){System.out.println(p);}
      static void pl(boolean p){System.out.println(p);}
      static void pl(){System.out.println();}
      static int[] ari(int n)throws IOException
      {
          int ar[]=new int[n];
          if(!st.hasMoreTokens())st=new StringTokenizer(br.readLine());
          for(int x=0;x<n;x++)ar[x]=Integer.parseInt(st.nextToken());
          return ar;
      }
      static int[][] ari(int n,int m)throws IOException
      {
          int ar[][]=new int[n][m];
          for(int x=0;x<n;x++)
          {
              if(!st.hasMoreTokens())st=new StringTokenizer(br.readLine());
              for(int y=0;y<m;y++)ar[x][y]=Integer.parseInt(st.nextToken());
          }
          return ar;
      }
      static long[] arl(int n)throws IOException
      {
          long ar[]=new long[n];
          if(!st.hasMoreTokens())st=new StringTokenizer(br.readLine());
          for(int x=0;x<n;x++) ar[x]=Long.parseLong(st.nextToken());
          return ar;
      }
      static long[][] arl(int n,int m)throws IOException
      {
          long ar[][]=new long[n][m];
          for(int x=0;x<n;x++)
          {
              if(!st.hasMoreTokens())st=new StringTokenizer(br.readLine());
              for(int y=0;y<m;y++)ar[x][y]=Long.parseLong(st.nextToken());
          }
          return ar;
      }
      static String[] ars(int n)throws IOException
      {
          String ar[]=new String[n];
          if(!st.hasMoreTokens())st=new StringTokenizer(br.readLine());
          for(int x=0;x<n;x++) ar[x]=st.nextToken();
          return ar;
      }
      static double[] ard(int n)throws IOException
      {
          double ar[]=new double[n];
          if(!st.hasMoreTokens())st=new StringTokenizer(br.readLine());
          for(int x=0;x<n;x++)ar[x]=Double.parseDouble(st.nextToken());
          return ar;
      }
      static double[][] ard(int n,int m)throws IOException
      {
          double ar[][]=new double[n][m];
          for(int x=0;x<n;x++)
          {
              if(!st.hasMoreTokens())st=new StringTokenizer(br.readLine());
              for(int y=0;y<m;y++)ar[x][y]=Double.parseDouble(st.nextToken());
          }
          return ar;
      }
      static char[] arc(int n)throws IOException
      {
          char ar[]=new char[n];
          if(!st.hasMoreTokens())st=new StringTokenizer(br.readLine());
          for(int x=0;x<n;x++)ar[x]=st.nextToken().charAt(0);
          return ar;
      }
      static char[][] arc(int n,int m)throws IOException
      {
          char ar[][]=new char[n][m];
          for(int x=0;x<n;x++)
          {
              String s=br.readLine();
              for(int y=0;y<m;y++)ar[x][y]=s.charAt(y);
          }
          return ar;
      }
      static void p(int ar[])
      {
          StringBuilder sb=new StringBuilder(11*ar.length);
          for(int a:ar)
          {
              sb.append(a);
              sb.append(' ');
          }
          System.out.println(sb);
      }
      static void p(int ar[][])
      {
          StringBuilder sb;
          for(int a[]:ar)
          {
              sb=new StringBuilder(2*a.length);
              for(int aa:a)
              {
                  sb.append(aa);
                  sb.append(' ');
              }
              System.out.println(sb);
          }
      }
      static void p(long ar[])
      {
          StringBuilder sb=new StringBuilder(20*ar.length);
          for(long a:ar)
          {
              sb.append(a);
              sb.append(' ');
          }
          System.out.println(sb);
      }
      static void p(long ar[][])
      {
          StringBuilder sb;
          for(long a[]:ar)
          {
              sb=new StringBuilder(2*a.length);
              for(long aa:a)
              {
                  sb.append(aa);
                  sb.append(' ');
              }
              System.out.println(sb);
          }
      }
      static void p(String ar[])
      {
          StringBuilder sb=new StringBuilder(2*ar.length);
          for(String a:ar)
          {
              sb.append(a);
              sb.append(' ');
          }
          System.out.println(sb);
      }
      static void p(double ar[])
      {
          StringBuilder sb=new StringBuilder(20*ar.length);
          for(double a:ar)
          {
              sb.append(a);
              sb.append(' ');
          }
          System.out.println(sb);
      }
      static void p(double ar[][])
      {
          StringBuilder sb;
          for(double a[]:ar)
          {
              sb=new StringBuilder(4*a.length);
              for(double aa:a)
              {
                  sb.append(aa);
                  sb.append(' ');
              }
              System.out.println(sb);
          }
      }
      static void p(char ar[])
      {
          StringBuilder sb=new StringBuilder(2*ar.length);
          for(char aa:ar)
          {
              sb.append(aa);
              sb.append(' ');
          }
          System.out.println(sb);
      }
      static void p(char ar[][])
      {
          StringBuilder sb;
          for(char a[]:ar)
          {
              sb=new StringBuilder(2*a.length);
              for(char aa:a)
              {
                  sb.append(aa);
                  sb.append(' ');
              }
              System.out.println(sb);
          }
      }
  }
  