#include "combo.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
struct custom_hash
{
template<class T>
unsigned long long operator()(T v) const
{
unsigned long long x = v;
x += FIXED_RANDOM; x += 11400714819323198485ull;
x = (x ^ (x >> 30)) * 13787848793156543929ull;
x = (x ^ (x >> 27)) * 10723151780598845931ull;
return x ^ (x >> 31);
}
};
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;
template<class T>
void ckmin(T &a, T b)
{
a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
T nmod(T &x, U mod)
{
if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
return (b ? gcd(b, a % b) : a);
}
template<class T>
T randomize(T mod)
{
return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;
#define sz(x) ((int) (x.size()))
const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;
#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
char ch[3];
string guess_sequence(int N)
{
string ans = "";
int lol1 = press("A"), lol2 = press("B"), lol3 = press("X");
if (lol1 == 1)
{
ch[0] = 'B'; ch[1] = 'X'; ch[2] = 'Y';
ans += 'A';
}
else if (lol2 == 1)
{
ch[0] = 'A'; ch[1] = 'X'; ch[2] = 'Y';
ans += 'B';
}
else if (lol3 == 1)
{
ch[0] = 'A'; ch[1] = 'B'; ch[2] = 'Y';
ans += 'X';
}
else
{
ch[0] = 'A'; ch[1] = 'B'; ch[2] = 'X';
ans += 'Y';
}
while(ans.length() < N - 1)
{
string t = ans + ch[0] + ch[0] + ans + ch[0] + ch[1] + ans + ch[1] + ch[0];
int x = press(t);
if (x == ans.length() + 0)
{
ans += ch[2];
continue;
}
else if (x == ans.length() + 1)
{
t = ans + ch[1] + ch[2];
x = press(t);
//ac, bb, bc
if (x == ans.length() + 0)
{
ans += ch[0]; ans += ch[2];
}
else if (x == ans.length() + 1)
{
ans += ch[1]; ans += ch[1];
}
else if (x == ans.length() + 2)
{
ans += ch[1]; ans += ch[2];
}
}
else if (x == ans.length() + 2)
{
//aa, ab, ba
t = ans + ch[0] + ch[0];
x = press(t);
if (x == ans.length() + 0)
{
ans += ch[1]; ans += ch[0];
}
else if (x == ans.length() + 1)
{
ans += ch[0]; ans += ch[1];
}
else if (x == ans.length() + 2)
{
ans += ch[0]; ans += ch[0];
}
}
}
if (ans.length() == N - 1)
{
string t = ans + ch[0];
lol1 = press(t);
t = ans + ch[1];
lol2 = press(t);
if (lol1 == ans.length() + 1) ans += ch[0];
else if (lol2 == ans.length() + 1) ans += ch[1];
else ans += ch[2];
}
return ans;
}
