#include "scales.h"

// Skyqwq
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back

typedef long long LL;
typedef pair<int, int> PII;

template <typename T> void inline read(T &x) {
    x = 0; int f = 1; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') { f = -1; } s = getchar(); }
    while (s >= '0' && s <= '9') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

template <typename T> bool inline chkMin(T &x, T y) { return y < x ? x = y, 1 : 0; }
template <typename T> bool inline chkMax(T &x, T y) { return y > x ? x = y, 1 : 0; }

int p[6];

typedef vector<vector<int> > VII;

map<VII, int> F;

struct Node{
    int a, b, c, o, d;
};

map<VII, Node> G;

vector<VII> get(VII u, int a, int b, int c, int o) {
    vector<VII> w(6);
    for (auto z: u) {
        int ct = 0;
        for (int i = 0; i < 6; i++) {
            if (z[i] == a || z[i] == b || z[i] == c) {
                if (ct == o) {
                    w[z[i]].pb(z);
                    break;
                }
                ++ct;
            }
        }
    }
    return w;
}

vector<VII> nxt(VII u, int a, int b, int c, int d) {
    vector<VII> w(6);
    for (auto z: u) {
        int ct = 0, la = -1;
        bool ok = 0;
        for (int i = 5; i >= 0; i--) {
            if (z[i] == a || z[i] == b || z[i] == c) {
                la = z[i];
            } else if (z[i] == d) {
                if (la != -1) {

                    ok = 1;
                    w[la].pb(z);
                    break;
                }
            }
        }
        if (!ok) w[la].pb(z);
    }
    return w;
}

int idx;

typedef unsigned long long ULL;

ULL hs(VII u) {
    ULL h = 0;
    for (auto z: u) {
        for (auto p: z) h = h * 131 + p;
    }
return h;
}

set<ULL> MP;

ULL jh[19] = { 2871759544976769004ull,
11035422555750466624ull,
10398776970505423982ull,
1029765801211822601ull,
7438562353508820686ull,
6571087375544317684ull,
15501493370790140578ull,
13153377130351303880ull,
5738564742931493182ull,
5800512769164071828ull,
17754323775520886700ull,
8243062892669489220ull,
37285265578777208ull,
16412641408023557884ull,
9831375555853990402ull,
10633800427827535330ull,
16361719302357925338ull,
15302561978660582732ull,
16306498537461469856ull};

int dp(VII u) {
    if (u.size() <= 1) return 0;
    if (F.count(u)) return F[u];
    F[u] = 1e9;
    // cerr << u.size() << "??" << endl;
    // for (auto o: u) {
    //     for (int v: o) cerr << v << " ";
    //         cerr << endl;
    // }
    vector<pair<pair<int, Node>, vector<VII> > > sm;
    for (int i = 0; i < 6; i++) {
        for (int j = 0; j < i; j++) {
            for (int k = 0; k < j; k++) {
                for (int o = 0; o < 2; o++) {
                    vector<VII> w = get(u, i, j, k, o);
                    int rs = 0, fj = 0;
                    for (VII v: w) if (v.size()) rs++, chkMax(fj, (int)v.size());
                    if (rs <= 1) continue;
                    sm.pb(mp(mp(fj, (Node) { i, j, k, o, 0} ), w));
                }
            }
        }
    }

    for (int i = 0; i < 6; i++) {
        for (int j = 0; j < i; j++) {
            for (int k = 0; k < j; k++) {
                for (int o = 0; o < 6; o++) {
                    if (o == i || o == j || o == k) continue;
                    vector<VII> w = nxt(u, i, j, k, o);
                    int rs = 0, fj = 0;
                    for (VII v: w) if (v.size()) rs++, chkMax(fj, (int)v.size());
                    if (rs <= 1) continue;
                    sm.pb(mp(mp(fj, (Node) { i, j, k, 3, o} ), w));
                }
            }
        }
    }
    sort(sm.begin(), sm.end(), [&](auto x, auto y) { return x.fi.fi < y.fi.fi; });
    int ct = 0;
    int nm = u.size();
    int lim = MP.count(hs(u)) ? 1 : 0;
    int now = 0, jc = -1;
 //   for (auto o: sm) {
        auto o = sm[lim];
        auto w = o.se;
        int ret = 0;
        for (VII v: w) chkMax(ret, dp(v));
        if ( chkMin(F[u], ret + 1)) G[u] = o.fi.se, jc = now;
   //     if (++ct == lim) break;
        now++;
//    }
 //   if (jc == 1) {
 //       cerr << hs(u) << "," << endl;
  //  }
    ++idx;
    return F[u];
}

void init(int T) {
    vector<int> a;
    for (int i = 0; i < 19; i++) MP.insert(jh[i]);
    for (int i = 0; i < 6; i++) a.pb(i);
    VII s;
    do {
        s.pb(a);
    } while (next_permutation(a.begin(), a.end()));
   // cerr << dp(s) << " zsw" << endl;
    dp(s);
    /* ... */
}

int W[7];

void orderCoins() {
    /* ... */

     vector<int> a;
    for (int i = 0; i < 6; i++) a.pb(i);
    VII u;
    do {
        u.pb(a);
    } while (next_permutation(a.begin(), a.end()));
    while (u.size() > 1) {
        Node o = G[u];
       // cerr << o.a + 1 << " " << o.b + 1 << " " << o.c + 1 << " " << o.o << " " << o.d + 1 << endl;
        int ans = -1;
        if (o.o == 0) ans = getLightest(o.a + 1, o.b + 1, o.c + 1);
        else if (o.o == 1) ans = getMedian(o.a + 1, o.b + 1, o.c + 1);
        else if (o.o == 2) ans = getHeaviest(o.a + 1, o.b + 1, o.c + 1);
        else ans = getNextLightest(o.a + 1, o.b + 1, o.c + 1, o.d + 1);
        ans--;
       // cerr << ans + 1 << "???\n";
        vector<VII> z;
        if (o.o <= 2) z = get(u, o.a, o.b, o.c, o.o);
        else z = nxt(u, o.a, o.b, o.c, o.d);
        u = z[ans];
    }
    for (int i = 0; i < 6; i++) W[i] = u[0][i] + 1;
    answer(W);
}