#include "scales.h"
#include <bits/stdc++.h>
using namespace std;
int mx = -1;
map<pair<int, int>, bool> comp {};
void init(int T) {
/* ... */
}
bool comp1(int a, int b) {
if (a == b)
return false;
if (comp.find({a, b}) != comp.end())
return comp[{a, b}];
int c = -1;
for (int i = 1; i <= 6; i++)
if (i != a && i != b)
c = i;
int small = getLightest(a, b, c);
int big = getHeaviest(a, b, c);
vector<int> ls {a, b, c};
for (auto& x: ls) {
if (x != small) {
comp[{small, x}] = true;
comp[{x, small}] = false;
}
if (x != big) {
comp[{x, big}] = true;
comp[{big, x}] = false;
}
}
if (b == big || a == small) {
comp[{a, b}] = comp[{b, a}] = true;
return true;
}
if (b == small || a == big) {
comp[{a, b}] = comp[{b, a}] = false;
return false;
}
return false;
}
bool comp2(int a, int b) {
if (a == b)
return false;
if (comp.find({a, b}) != comp.end())
return comp[{a, b}];
if (b == mx) {
comp[{a, b}] = true;
comp[{b, a}] = false;
return true;
}
if (a == mx) {
comp[{a, b}] = false;
comp[{b, a}] = true;
return false;
}
int small = getLightest(a, b, mx);
comp[{a, b}] = comp[{b, a}] = small == a;
return small == a;
}
void orderCoins() {
/* ... */
int W[] = {1, 2, 3, 4, 5, 6};
comp.clear();
/*vector<int> cur {};
for (int i = 1; i <= 6; i++) {
if ((int)cur.size() < 3) {
cur.push_back(i);
}
if ((int)cur.size() == 3) {
mx = getHeaviest(cur[0], cur[1], cur[2]);
cur = {mx};
}
}
if ((int)cur.size() > 1) {
for (int i = 1; (int)cur.size() < 3 && i <= 6; i++) {
if (find(cur.begin(), cur.end(), i) == cur.end()) {
cur.push_back(i);
}
}
mx = getHeaviest(cur[0], cur[1], cur[2]);
}*/
//cout << "mx is " << mx << '\n';
stable_sort(W, W + 6, comp1);
answer(W);
}
