//Never stop trying
#include "scales.h"
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef string str;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up
template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
void IO() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int arr[7];
int hsh[7];
//sort 1,2,3
//sort 4,5,6
//assign {4,5,6} to their positions
void init(int T){
return;
}
int mp[7];
bool cmp(int a, int b){
return mp[a]<mp[b];
}
void orderCoins(){
int ans[6];
int a=getLightest(1,2,3);
int c=getHeaviest(1,2,3);
int b; FOR(i,1,4) if(a!=i && c!=i) b=i;
/*dbgs(a,b);
dbg(c);*/
int d=getLightest(4,5,6);
int f=getHeaviest(4,5,6);
int e; FOR(i,4,7) if(d!=i && f!=i) e=i;
mp[d]=4; mp[e]=5; mp[f]=6;
vi vec[4]; //4 gaps between (a,b,c)
for(auto v:{d,e,f}){
int u=getMedian(a,b,v);
if(u==a) vec[0].pb(v);
else if(u==v) vec[1].pb(v);
else{
u=getMedian(b,c,v);
if(u==v) vec[2].pb(v);
else vec[3].pb(v);
}
}
FOR(i,0,4){
sort(all(vec[i]),cmp);
}
vi v;
for(auto x: vec[0]) v.pb(x);
v.pb(a);
for(auto x: vec[1]) v.pb(x);
v.pb(b);
for(auto x: vec[2]) v.pb(x);
v.pb(c);
for(auto x: vec[3]) v.pb(x);
FOR(i,0,6) ans[i]=v[i];
answer(ans);
return;
}
/* Careful!!!
.Array bounds
.Infinite loops
.Uninitialized variables / empty containers
.Order of input
Some insights:
.Binary search
.Graph representation
.Write brute force code
.Change your approach
*/
