#include "combo.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define ff first
#define ss second
#define enld endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<ll,ll> pll;
const ll sz=2e5+100;
const ll mod=1e9+7;
const ll inf=1e18;
template<class T>
using indexed_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
string guess_sequence(int n){
string s="";
if(press("A")==1) s+="A";
if(press("B")==1) s+="B";
if(press("X")==1) s+="X";
if(press("Y")==1) s+="Y";
for(ll i=1;i<n;i++){
if(press(s+"A")==i+1){
s+="A";
continue;
}
if(press(s+"B")==i+1){
s+="B";
continue;
}
if(press(s+"X")==i+1){
s+="X";
continue;
}
if(press(s+"Y")==i+1){
s+="Y";
continue;
}
}
return s;
}
