Code mẫu

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

// #define constexpr(...) (__VA_ARGS__)
using ll = long long;
using ld = long double;
const ld eps = 1e-8;
// for matching the kactl notes
#define sz(x) ((int)x.size())
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define print_op(...) ostream &operator<<(ostream &out, const __VA_ARGS__ &u)
// DEBUGING TEMPLETE
// ////////////////////////////////////////////////////////////////////////{{{
// What? You wanted to see how this template works?  Check this out:
// https://quangloc99.github.io/2021/07/30/my-CP-debugging-template.html
#define db(val) "[" #val " = " << (val) << "] "
#define CONCAT_(x, y) x##y
#define CONCAT(x, y) CONCAT_(x, y)
#ifdef LOCAL_DEBUG
#define clog cerr << setw(__db_level * 2) << setfill(' ') << "" << setw(0)
#define DB() debug_block CONCAT(dbbl, __LINE__)
int __db_level = 0;
struct debug_block {
    debug_block() {
        clog << "{" << endl;
        ++__db_level;
    }
    ~debug_block() {
        --__db_level;
        clog << "}" << endl;
    }
};
#else
#define clog                                                                   \
    if (0) cerr
#define DB(...)
#endif

template <class U, class V> print_op(pair<U, V>) {
    return out << "(" << u.first << ", " << u.second << ")";
}
template <size_t i, class T>
ostream &print_tuple_utils(ostream &out, const T &tup) {
    if constexpr (i == tuple_size<T>::value) return out << ")";
    else
        return print_tuple_utils<i + 1, T>(
            out << (i ? ", " : "(") << get<i>(tup), tup);
}
template <class... U> print_op(tuple<U...>) {
    return print_tuple_utils<0, tuple<U...>>(out, u);
}
template <class Con, class = decltype(begin(declval<Con>()))>
typename enable_if<!is_same<Con, string>::value, ostream &>::type
operator<<(ostream &out, const Con &con) {
    out << "{";
    for (auto beg = con.begin(), it = beg; it != con.end(); ++it)
        out << (it == beg ? "" : ", ") << *it;
    return out << "}";
}
// ACTUAL SOLUTION START HERE
// ////////////////////////////////////////////////////////////////}}}

int main() {
#ifdef LOCAL
    freopen("main.inp", "r", stdin);
    freopen("main.out", "w", stdout);
    freopen(".log", "w", stderr);
#endif
    cin.tie(0)->sync_with_stdio(0);

    int ntest;
    cin >> ntest;
    while (ntest--) {
        int n;
        cin >> n;
        vector<int> dec(n);
        for (auto& i: dec) cin >> i;

        set<int> pos;
        rep(i, 0, n) pos.insert(i);

        int cnt = 0;
        bool found;
        auto it = pos.begin();

        auto check_and_del = [&]() -> bool {
            auto a = it;
            if (a == pos.end()) return false;
            auto b = next(a);
            if (b == pos.end()) return false;
            auto c = next(b);
            if (c == pos.end()) return false;
            auto d = next(c);
            if (d == pos.end()) return false;
            if (dec[*a] == 2 and dec[*b] == 0 and dec[*c] == 2 and dec[*d] == 3) {
                rep(i, 0, 4) it = pos.erase(it);
                ++cnt;
                return true;
            }
            return false;
        };

        while (it != pos.end()) {
            if (!check_and_del()) {
                ++it;
                continue;
            }
            rep(i, 0, 4) {
                if (it == pos.begin()) break;
                --it;
            }
        }

        if (cnt == 0) {
            cout << ":(\n";
        } else if (cnt & 1) {
            cout << "Bedao\n";
        } else {
            cout << "Bemai\n";
        }
    }

    return 0;
}