#include #include #include #include #include #include #include #include #include #include #include #include #define REP(i,n) for(ll i=0;i<(n);i++) #define MOD 1000000007 #define int long long #ifdef int const long long INF = LLONG_MAX / 10; #else const int INF = 1010101010; #endif using namespace std; typedef long long ll; typedef vector> mat; typedef pair P; //typedef pair P; #ifdef LOCAL #define dump(...) \ do { \ std::ostringstream os; \ os << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; \ print_to(os, ", ", "\n", __VA_ARGS__); \ std::cerr << os.str(); \ } while (0) #define dump_(a) \ do { \ std::ostringstream os; \ os << __LINE__ << ":\t" << #a << " = ["; \ print_to_(os, ", ", "]\n", all(a)); \ std::cerr << os.str(); \ } while (0) #else #define dump(...) #define dump_(...) #endif template void print_to(std::ostream &os, const char *, const char *tail, const T &fst) { os << fst << tail; } template void print_to(std::ostream &os, const char *del, const char *tail, const Fst &fst, const Rst &... rst) { os << fst << del; print_to(os, del, tail, rst...); } template void print_to_(std::ostream &os, const char *del, const char *tail, Iter bgn, Iter end) { for (Iter it = bgn; it != end;) { os << *it; if (++it != end) { os << del; } else { os << tail; } } } template void println(const Fst &fst, const Rst &... rst) { print_to(std::cout, "\n", "\n", fst, rst...); } template void print(const Fst &fst, const Rst &... rst) { print_to(std::cout, " ", "\n", fst, rst...); } template void println_(Iter bgn, Iter end) { print_to_(std::cout, "\n", "\n", bgn, end); } template void print_(Iter bgn, Iter end) { print_to_(std::cout, " ", "\n", bgn, end); } // const int MOD = 1000000007; namespace trush { int _ = (std::cout.precision(10), std::cout.setf(std::ios::fixed), std::cin.tie(0), std::ios::sync_with_stdio(0), 0); } int NN; int CC[200]; int C[200]; signed main() { cin >> NN; int sum = 0; REP(i,NN) { cin >> CC[i]; sum += C[i]; } int N = 0; int up2 = 0; REP(i,NN) { if (CC[i] != 0) { if (CC[i] >= 2) up2++; C[N++] = CC[i]; } } if (N == 0) { cout << "B" << endl; return 0; } if (N == 1) { if (C[0] == 1) { cout << "A" << endl; return 0; } else { cout << "B" << endl; return 0; } } else if (N == 2) { if (C[0] == 1 && C[1] == 1) { cout << "B" << endl; return 0; } else if (C[0] == 1 && C[1] == 2) { cout << "A" << endl; return 0; } else if (C[0] == 2 && C[1] == 1) { cout << "A" << endl; return 0; } else { cout << "B" << endl; return 0; } } else { if (*max_element(C, C + N) >= 3) { //assert(false); /* if (up2 == 1) { if (N % 2 == 0) { cout << "A" << endl; return 0; } } */ cout << "B" << endl; return 0; } else if (up2 >= 2) { cout << "B" << endl; return 0; } else if (up2 == 1) { if (N % 2 == 0) { cout << "A" << endl; return 0; } else { cout << "B" << endl; return 0; } } else { if (N % 2 == 0) { cout << "B" << endl; } else { cout << "A" << endl; } } } }