#include "scales.h"
using namespace std;
#include <bits/stdc++.h>
void init(int T) {
/* ... */
}
int checkComp(vector<vector<int>> perms, vector<int> elems, int op) {
if (op == 0) { // min
vector<vector<vector<int>>> smallPerms(3);
for (int chosen = 0; chosen<3; chosen++) {
for (int i = 0; i < perms.size(); i++) {
if (perms[i][elems[chosen]] < perms[i][elems[(chosen+1)%3]] && perms[i][elems[chosen]] < perms[i][elems[(chosen+2)%3]]) {
smallPerms[chosen].push_back(perms[i]);
}
}
}
set<int> sizes = {(int)smallPerms[0].size(), (int)smallPerms[1].size(), (int)smallPerms[2].size()};
return (*sizes.rbegin());
}
if (op == 1) { // max
vector<vector<vector<int>>> smallPerms(3);
for (int chosen = 0; chosen<3; chosen++) {
for (int i = 0; i < perms.size(); i++) {
if (perms[i][elems[chosen]] > perms[i][elems[(chosen+1)%3]] && perms[i][elems[chosen]] > perms[i][elems[(chosen+2)%3]]) {
smallPerms[chosen].push_back(perms[i]);
}
}
}
set<int> sizes = {(int)smallPerms[0].size(), (int)smallPerms[1].size(), (int)smallPerms[2].size()};
return (*sizes.rbegin());
}
if (op == 2) { // med
vector<vector<vector<int>>> smallPerms(3);
for (int chosen = 0; chosen<3; chosen++) {
for (int i = 0; i < perms.size(); i++) {
if ((perms[i][elems[chosen]] > perms[i][elems[(chosen+1)%3]] && perms[i][elems[chosen]] < perms[i][elems[(chosen+2)%3]]) || (perms[i][elems[chosen]] < perms[i][elems[(chosen+1)%3]] && perms[i][elems[chosen]] > perms[i][elems[(chosen+2)%3]])) {
smallPerms[chosen].push_back(perms[i]);
}
}
}
set<int> sizes = {(int)smallPerms[0].size(), (int)smallPerms[1].size(), (int)smallPerms[2].size()};
return (*sizes.rbegin());
}
if (op == 3) { // weird
// return 1e9;
vector<vector<vector<int>>> smallPerms(3);
for (int chosen = 0; chosen<3; chosen++) {
for (int i = 0; i < perms.size(); i++) {
int comp = perms[i][elems[3]];
set<int> bigger;
for (int j = 0; j<3; j++) if(perms[i][elems[j]]>comp) bigger.insert(perms[i][elems[j]]);
if (bigger.empty()) for (int j = 0; j<3; j++) bigger.insert(perms[i][elems[j]]);
if ((*bigger.begin()) == perms[i][elems[chosen]]) smallPerms[chosen].push_back(perms[i]);
}
}
set<int> sizes = {(int)smallPerms[0].size(), (int)smallPerms[1].size(), (int)smallPerms[2].size()};
return (*sizes.rbegin());
}
}
void updatePerms(vector<vector<int>> &perms, vector<int> elems, int op, int res) {
if (op == 0) { // min
vector<vector<int>> smallPerms;
int chosen = 0;
if (res == elems[1]) chosen = 1;
if (res == elems[2]) chosen = 2;
for (int i = 0; i < perms.size(); i++) {
if (perms[i][elems[chosen]] < perms[i][elems[(chosen+1)%3]] && perms[i][elems[chosen]] < perms[i][elems[(chosen+2)%3]]) {
smallPerms.push_back(perms[i]);
}
}
perms = smallPerms;
}
if (op == 1) { // max
vector<vector<int>> smallPerms;
int chosen = 0;
if (res == elems[1]) chosen = 1;
if (res == elems[2]) chosen = 2;
for (int i = 0; i < perms.size(); i++) {
if (perms[i][elems[chosen]] > perms[i][elems[(chosen+1)%3]] && perms[i][elems[chosen]] > perms[i][elems[(chosen+2)%3]]) {
smallPerms.push_back(perms[i]);
}
}
perms = smallPerms;
}
if (op == 2) { // med
vector<vector<int>> smallPerms;
int chosen = 0;
if (res == elems[1]) chosen = 1;
if (res == elems[2]) chosen = 2;
for (int i = 0; i < perms.size(); i++) {
if ((perms[i][elems[chosen]] > perms[i][elems[(chosen+1)%3]] && perms[i][elems[chosen]] < perms[i][elems[(chosen+2)%3]]) || (perms[i][elems[chosen]] < perms[i][elems[(chosen+1)%3]] && perms[i][elems[chosen]] > perms[i][elems[(chosen+2)%3]])) {
smallPerms.push_back(perms[i]);
}
}
perms = smallPerms;
}
if (op == 3) { // weird
vector<vector<int>> smallPerms;
int chosen = 0;
if (res == elems[1]) chosen = 1;
if (res == elems[2]) chosen = 2;
for (int i = 0; i < perms.size(); i++) {
int comp = perms[i][elems[3]];
set<int> bigger;
for (int j = 0; j<3; j++) if(perms[i][elems[j]]>comp) bigger.insert(perms[i][elems[j]]);
if (bigger.empty()) for (int j = 0; j<3; j++) bigger.insert(perms[i][elems[j]]);
if ((*bigger.begin()) == perms[i][elems[chosen]]) smallPerms.push_back(perms[i]);
}
perms = smallPerms;
}
}
void orderCoins() {
vector<vector<int>> perms;
vector<int> currPerm = {0,1,2,3,4,5};
do {
perms.push_back(currPerm);
} while(next_permutation(currPerm.begin(), currPerm.end()));
while (perms.size() > 1) {
// cerr << perms.size() << "\n";
int best = 1e9;
vector<int> elems;
int OP = -1;
for (int i = 0; i<6; i++) {
for (int j = 0; j<6; j++) {
for (int k = 0; k<6; k++) {
if (i == j || j == k || i == k) continue;
for (int op = 0; op<3; op++) {
if (checkComp(perms, {i,j,k}, op) < best) {elems = {i,j,k}; OP = op; best = checkComp(perms, {i,j,k}, op);}
}
for (int l = 0; l<6; l++) {
if (i == j || j == k || i == k || l == i || l == j || l == k) continue;
if (checkComp(perms, {i,j,k,l}, 3) < best) {elems = {i,j,k,l}; OP = 3; best = checkComp(perms, {i,j,k,l}, 3);}
}
if (best < 1) break;
}
if (best < 1) break;
}
if (best < 1) break;
}
assert(OP != -1);
// cerr << OP << "\n";
if (OP==0) updatePerms(perms, elems, OP, getLightest(elems[0]+1, elems[1]+1, elems[2]+1)-1);
if (OP==1) updatePerms(perms, elems, OP, getHeaviest(elems[0]+1, elems[1]+1, elems[2]+1)-1);
if (OP==2) updatePerms(perms, elems, OP, getMedian(elems[0]+1, elems[1]+1, elems[2]+1)-1);
if (OP==3) updatePerms(perms, elems, OP, getNextLightest(elems[0]+1, elems[1]+1, elems[2]+1, elems[3]+1)-1);
}
// cerr << perms.size() << "\n";
int res[6];
for (int i = 0; i<6; i++) {
res[perms[0][i]] = i+1;
}
answer(res);
}
