/*************************************
* author: marvinthang *
* created: 06.03.2023 15:25:06 *
*************************************/
#include "scales.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i--; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> scan_op(pair <U, V>) { return in >> u.fi >> u.se; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
// end of template
void init(int T) {
}
void orderCoins() {
int W[] = {1, 2, 3, 4, 5, 6};
vector <int> res, v {1, 2, 3};
int mi = getLightest(1, 2, 3);
v.erase(find(ALL(v), mi));
int a = getMedian(v[0], v[1], 4);
if (a == 4) {
int b = getMedian(1, 2, 3);
res = vector<int>({mi, b, 4, 6 - mi - b});
} else {
int b = getMedian(mi, 6 - mi - a, 4);
if (b == mi) res = vector<int>({4, mi, a, 6 - mi - a});
else if (b == 4) res = vector<int>({mi, 4, a, 6 - mi - a});
else res = vector<int>({mi, 6 - mi - a, a, 4});
}
a = getNextLightest(res[0], res[1], res[2], 5);
if (a == res[1]) res.insert(res.begin() + 1, 5);
else if (a == res[2]) res.insert(res.begin() + 2, 5);
else {
a = getMedian(res[0], res[3], 5);
if (a == res[0]) res.insert(res.begin(), 5);
else if (a == res[3]) res.push_back(5);
else res.insert(res.begin() + 3, 5);
}
a = getNextLightest(res[0], res[2], res[4], 6);
if (a == res[4]) {
a = getLightest(res[3], res[4], 6);
if (a == res[3]) res.insert(res.begin() + 4, 6);
else res.insert(res.begin() + 3, 6);
} else if (a == res[2]) {
a = getLightest(res[1], res[2], 6);
if (a == res[1]) res.insert(res.begin() + 2, 6);
else res.insert(res.begin() + 1, 6);
} else {
a = getLightest(res[0], res[1], 6);
if (a == res[0]) res.push_back(6);
else res.insert(res.begin(), 6);
}
copy(ALL(res), W);
answer(W);
}
