A. AB Balance

#include <bits/stdc++.h>

using namespace std;

string Solve(){
    string str;
    cin >> str;
    int len = str.size();
    int ab[len + 10];
    int ba[len + 10];
    for(int i=0;i<len;i++)
        ab[i] = ba[i] = 0;
    int cab = 0;
    int cba = 0;
    for(int i=1;i<len;i++){
        if(str[i] == 'a' and str[i-1] == 'b'){
            cab ++;
            ab[i] = ab[i-1] = cab;
        }
        if(str[i] == 'b' and str[i-1] == 'a'){
            cba ++;
            ba[i] = ba[i-1] = cba;
        }
    }

    if(cab == cba)
        return str;

    if(str[len-1] == 'a')
        str[len-1] = 'b';
    else
        str[len-1] = 'a';
    return str;

}

int main(){

    int Q;
    scanf("%d", &Q);

    while(Q--){
        cout << Solve() << '\n';
    }

    return 0;
}