#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

int powers[40];

int main()
{
  int testCases;
  scanf ("%d", &testCases);
  powers[0] = 1;
  for (int i = 1; i < 40; i++)
  {
    powers[i] = powers[i-1] * 3;
    if (powers[i] < powers[i-1])
    {
     powers[i] = -1;
     break;
    }
  }
  for (int i = 0; i < testCases; i++)
	{
		int weight;
		scanf("%d", &weight);
		int highest = -1;
		for (int j = 0; j < 40; j++)
		{
			if (powers[j] == -1 || powers[j] > weight)
			{
				highest = j - 1;
				break;
			}
		}
		for (int dim = highest; dim >= 0; dim--)
		{
		  int thisAmount = 0;
		  while (weight >= powers[dim])
		  {
			weight -= powers[dim];
			thisAmount++;   
		  }
		  printf("%d", thisAmount);
		  if (dim == 0)
		  {
			printf("\n");
		  }
		  else
		  {
			printf(" ");
		  }
		}
	}
}