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.
1
10111
 1
10555
 2
3000002
3000001
 1
3000002

3371 3370
 3519 3518
 1000000 1000001
1000001 1000000
 1000000 1000001

import java.util.*;
import java.io.*;
import java.math.BigInteger;

public class _practise {
	
	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()); 
		} 

		 int[] ia(int n)
		{
			int a[]=new int[n];
			for(int i=0;i<n;i++)a[i]=nextInt();
			return a;
		}
		 int[][] ia(int n , int m)
			{
				int a[][]=new int[n][m];
				for(int i=0;i<n;i++) for(int j=0;j<m ;j++) a[i][j]=nextInt();
				return a;
			}
		 long[][] la(int n , int m)
			{
				long a[][]=new long[n][m];
				for(int i=0;i<n;i++) for(int j=0;j<m ;j++) a[i][j]=nextLong();
				return a;
			}
		 char[][] ca(int n , int m)
			{
				char a[][]=new char[n][m];
				for(int i=0;i<n;i++)
					{
					String x =next();
					for(int j=0;j<m ;j++) a[i][j]=x.charAt(j);
					}
				return a;
			}

		long[] la(int n)
		{
			long a[]=new long[n];
			for(int i=0;i<n;i++)a[i]=nextLong();
			return a;
		}

		String nextLine() 
		{ 
			String str = ""; 
			try
			{ 
				str = br.readLine(); 
			} 
			catch (IOException e) 
			{ 
				e.printStackTrace(); 
			} 
			return str; 
		} 
	}
	static void sort(long[] a) 
	{int n=a.length;Random r=new Random();for (int i=0; i<a.length; i++) {long oi=r.nextInt(n), temp=a[i];a[i]=a[(int)oi];a[(int)oi]=temp;}Arrays.sort(a);}
    static void sort(int[] a) 
    {int n=a.length;Random r=new Random();for (int i=0; i<a.length; i++) {int oi=r.nextInt(n), temp=a[i];a[i]=a[oi];a[oi]=temp;}Arrays.sort(a);}
	public static long sum(long a[])
	{long sum=0; for(long i : a) sum+=i; return(sum);}
	public static long count(long a[] , long x)
	{long c=0; for(long i : a) if(i==x) c++; return(c);}
	public static int sum(int a[])
	{ int sum=0; for(int i : a) sum+=i; return(sum);}
	public static int count(int a[] ,int x)
	{int c=0; for(int i : a) if(i==x) c++; return(c);}
	public static int count(String s ,char ch)
	{int c=0; char x[] = s.toCharArray(); for(char i : x) if(ch==i) c++; return(c);}
	public static boolean prime(int n)
	{for(int i=2 ; i<=Math.sqrt(n) ; i++) if(n%i==0) return false; return true;}
	public static boolean prime(long n)
	{for(long i=2 ; i<=Math.sqrt(n) ; i++) if(n%i==0) return false; return true;}
	 public static int gcd(int n1, int n2)
	  { if (n2 != 0)return gcd(n2, n1 % n2); else return n1;}
	 public static long gcd(long n1, long n2)
	  { if (n2 != 0)return gcd(n2, n1 % n2); else return n1;}
	 public static int[] freq(int a[], int n)
	  { int f[]=new int[n+1]; for(int i:a) f[i]++; return f;}
	 public static int[] pos(int a[], int n)
	  { int f[]=new int[n+1]; for(int i=0; i<n ;i++) f[a[i]]=i; return f;}
	 
	
	 public static long mindig(long n)
	 {
		 long ans=9; while(n>0) { if(n%10<ans) ans=n%10; n/=10; }
		 return ans;
	 }
	 public static long maxdig(long n)
	 {
		 long ans=0; while(n>0) { if(n%10>ans) ans=n%10; n/=10; }
		 return ans;
	 }
	  
	public static boolean palin(String s)
	{
		StringBuilder sb = new StringBuilder();
		sb.append(s);
		String str=String.valueOf(sb.reverse());
		if(s.equals(str))
			return true;
		else return false;
	}
	
	public static void main(String args[])
	{

		FastReader in=new FastReader();
		PrintWriter so = new PrintWriter(new BufferedWriter(new  OutputStreamWriter(System.out)));
		_practise ob = new _practise();
		
	    int T = in.nextInt();
		//int T = 1;
	   
	  
	     while(T-->0)
		 {
	    	 long n = in.nextLong();
	    	 long x = (n%3==0)?n/3:n/3+1;
	    	 if(x*2+n/3==n) so.println(n/3+" "+x);
	    	 else so.println(x+" "+(n/3));
	     }
		
		so.flush();

		/*String s = in.next();
		 * Arrays.stream(f).min().getAsInt()
		 * BigInteger f = new BigInteger("1"); 1 ke jagah koi bhi value ho skta jo aap 
		 *                                       initial value banan chahte
			int a[] = new int[n];
			 Stack<Integer> stack = new Stack<Integer>();
			 	Deque<Integer> q = new LinkedList<>(); or Deque<Integer> q = new ArrayDeque<Integer>();
			PriorityQueue<Long> pq = new PriorityQueue<Long>();
			ArrayList<Integer> al = new ArrayList<Integer>(); 
			StringBuilder sb = new StringBuilder();
			HashSet<Integer> st = new LinkedHashSet<Integer>();
			Set<Integer> s = new HashSet<Integer>();
			Map<Long,Integer> hm = new HashMap<Long, Integer>(); //<key,value>
			 for(Map.Entry<Integer, Integer> i :hm.entrySet())
			HashMap<Integer, Integer> hmap = new HashMap<Integer, Integer>();
			so.println("HELLO");
			Arrays.sort(a,Comparator.comparingDouble(o->o[0]))
			 Arrays.sort(a, (aa, bb) -> Integer.compare(aa[1], bb[1]));
			 Set<String> ts = new TreeSet<>();*/
	}
}