#include "Anna.h"
#include <bits/stdc++.h>

using namespace std;

namespace {

int variable_example = 0;

}

void Anna(int X, int Y, int N, string S) {
  vector<vector<bool>> used(8, vector<bool>(8));
  for (int i = 0; i < 5; i++) {
    if (i != X && i != Y) {
      Paint(i, i, (X >> 2 & 1));
    }
    used[i][i] = true;
  }
  for (int i = 0; i < 5; i++) {
    if (i != X && i + 1 != Y) {
      Paint(i, i + 1, (Y >> 2 & 1));
    }
    used[i][i + 1] = true;
  }
  vector<pair<int, int>> cells;
  for (int i = 0; i < 8; i++) {
    for (int j = 0; j < 8; j++) {
      if (used[i][j]) {
        continue;
      }
      if ((i >> 2 & 1) != (X >> 2 & 1) && (j >> 2 & 1) != (Y >> 2 & 1)) {
        cells.emplace_back(i, j);
      }
    }
  }
  auto Do = [&](pair<int, int> p, int b) {
    int x = p.first;
    int y = p.second;
    used[x][y] = true;
    Paint(x, y, b);
  };
  Do(cells[0], X >> 0 & 1);
  Do(cells[1], X >> 1 & 1);
  Do(cells[2], Y >> 0 & 1);
  Do(cells[3], Y >> 1 & 1);
  int ptr = 0;
  for (int i = 0; i < 8; i++) {
    for (int j = 0; j < 8; j++) {
      if (i == X || j == Y || used[i][j]) {
        continue;
      }
      if (ptr < N) {
        Paint(i, j, S[ptr] == 'A' ? 0 : 1);
        ptr += 1;
      } else {
        Paint(i, j, 0);
      }
    }
  }
}

#include "Bruno.h"
#include <bits/stdc++.h>

using namespace std;

namespace {

int variable_example = 0;

}

string Bruno(int N, vector<vector<int>> T) {
  int X = 0, Y = 0;
  {
    vector<int> c(2);
    for (int i = 0; i < 5; i++) {
      c[T[i][i]] += 1;
    }
    if (c[1] > c[0]) {
      X += (1 << 2);
    }
  }
  {
    vector<int> c(2);
    for (int i = 0; i < 5; i++) {
      c[T[i][i + 1]] += 1;
    }
    if (c[1] > c[0]) {
      Y += (1 << 2);
    }
  }
  vector<vector<bool>> used(8, vector<bool>(8));
  for (int i = 0; i < 5; i++) {
    used[i][i] = true;
    used[i][i + 1] = true;
  }
  vector<pair<int, int>> cells;
  for (int i = 0; i < 8; i++) {
    for (int j = 0; j < 8; j++) {
      if (used[i][j]) {
        continue;
      }
      if ((i >> 2 & 1) != (X >> 2 & 1) && (j >> 2 & 1) != (Y >> 2 & 1)) {
        cells.emplace_back(i, j);
      }
    }
  }
  X += (T[cells[0].first][cells[0].second]) * 1;
  X += (T[cells[1].first][cells[1].second]) * 2;
  Y += (T[cells[2].first][cells[2].second]) * 1;
  Y += (T[cells[3].first][cells[3].second]) * 2;
  for (int i = 0; i < 4; i++) {
    used[cells[i].first][cells[i].second] = true;
  }
  string res = "";
  for (int i = 0; i < 8; i++) {
    for (int j = 0; j < 8; j++) {
      if (used[i][j]) {
        continue;
      }
      if (i == X || j == Y) {
        continue;
      }
      if ((int) res.size() < N) {
        res += (T[i][j] == 0 ? 'A' : 'B');
      }
    }
  }
  return res;
}