#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint = atcoder::modint998244353;
// using mint = double;

#define rep(i, l, r) for (int i = (int)(l); i<(int)(r); i++)
#define ll long long
#define ld long double
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define siz(x) (int)(x).size()

template<class T> bool chmin(T& a, T b) { if (a > b) {a = b; return true;} return false; }
template<class T> bool chmax(T& a, T b) { if (a < b) {a = b; return true;} return false; }

const int inf = 1e9;
const ll INF = 4e18;

template<class T> using pq = priority_queue<T, vector<T>, less<T>>;
template<class T> using spq = priority_queue<T, vector<T>, greater<T>>;

vector<int> di = {0, 0, 1, -1};
vector<int> dj = {1, -1, 0, 0};

struct Edge {
    int to, cost;
};

void solve() {
    string S; cin >> S;
    int N = siz(S);
    set<int> unused;
    rep(i, 0, N) unused.insert(i);
    int B = -1;
    rep(k, 0, 2*N+1) {
        if (k%2 == 0) {
            //Alice
            if (unused.empty()) {
                break;
            }
            int i = *unused.begin();
            unused.erase(i);
            if (S[i] == 'C') {
                S[i] = 'A';
            }
            else break;
        }
        else {
            //Bob
            if (B == -1) {
                if (unused.empty()) {
                    break;
                }
                int i = *unused.begin();
                unused.erase(i);
                if (S[i] == 'A') {
                    S[i] = 'B';
                    B = i;
                }
                else if (S[i] == 'B') {
                    S[i] = 'C';
                    B = -1;
                }
            }
            else {
                assert(S[B] == 'B');
                S[B] = 'C';
                B = -1;
            }
        }
    }
    cout << S << endl;
}

int main() {
    int T; cin >> T;
    while(T--) solve();
}