#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <vector>

using namespace std;

#define FOR(prom, a, b) for(int prom = (a); prom < (b); prom++)
#define FORD(prom, a, b) for(int prom = (a); prom > (b); prom--)
#define FORDE(prom, a, b) for(int prom = (a); prom >= (b); prom--)

#define DRI(a) int a; scanf("%d ", &a);
#define DRII(a, b) int a, b; scanf("%d %d ", &a, &b);

#define RI(a) scanf("%d ", &a);
#define RII(a, b) scanf("%d %d ", &a, &b);

#define PB push_back
#define MP make_pair

#define ll long long
#define ull unsigned long long

#define MM(co, cim) memset((co), (cim), sizeof((co)))

#define DEB(x) cerr << ">>> " << #x << " : " << x << endl;

int n, k, t, cc;
vector<int> p;
bool first;

int main ()
{
  t = 1;
  while (t < 10000000)
  {
    p.PB(t);
    t *= 3;
  }
  scanf("%d", &n);
  FOR(i, 0, n)
  {
    first = true;
    scanf("%d", &k);
    FORDE(j, p.size() - 1, 0)
    {
      cc = 0;
      while (p[j] <= k)
      {
        ++cc;
        first = false;
        k -= p[j];
      }
      if (!first) printf("%d%s", cc, j ? " " : "\n");
    }
  }
  return 0;
}