#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;

const int maxN = 43;
const int COPIES = 5;

namespace {

int possget(int a,int b){
	int curr = 0;
	for(int i=0;i<8;i++){
		for(int j=0;j<8;j++){
			if(i==a and j==b)return curr;
			curr++;
		}
	}
}

}

void Anna(int X, int Y, int N, string S) {
	int currpos = possget(X,Y);
	vector<vector<bool>> skip(8,vector<bool>(8));
	for(int i=0;i<8;i++)skip[i][Y]=skip[X][i]=true;
	while(S.size()<maxN)S.insert(S.end(),'A');
	long long num_to_write = 0;
	for(int i=0;i<maxN;i++)if(S[i]=='B')num_to_write|=(1ll<<i);
	for(int i=0;i<COPIES;i++){
		num_to_write<<=6;
		num_to_write+=currpos;
	}
	int bit = 0;
	for(int i=0;i<8;i++){
		if(i==X)continue;
		for(int j=0;j<8;j++){
			if(j==Y)continue;
			Paint(i,j,min(1ll,num_to_write&(1ll<<bit)));
			bit++;
		}
	}
}

#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;

const int maxN = 43;
const int COPIES = 5;

namespace {

pair<int,int> possget(int x){
	int curr = 0;
	for(int i=0;i<8;i++){
		for(int j=0;j<8;j++){
			if(curr++==x)return {i,j};
		}
	}
}

string getans(vector<vector<int>> &T,int X,int Y,int N){
	long long num_to_read = 0;
	int bit = 0;
	for(int i=0;i<8;i++){
		if(i==X)continue;
		for(int j=0;j<8;j++){
			if(j==Y)continue;
			if(T[i][j])num_to_read|=(1ll<<bit);
			bit++;
		}
	}
	for(int i=0;i<COPIES;i++){
		if(possget(num_to_read%(1<<6))!=make_pair(X,Y))return "";
		num_to_read>>=6;
	}
	string ans;
	for(int i=0;i<N;i++)
		if(num_to_read&(1ll<<i))ans.insert(ans.end(),'B');
		else ans.insert(ans.end(),'A');
	return ans;
}

}

string Bruno(int N, vector<vector<int>> T) {
	for(int i=0;i<8;i++){
		for(int j=0;j<8;j++){
			auto ans = getans(T,i,j,N);
			if(ans!="")return ans;
		}
	}
	assert(false);
}