description: You are given a string s of length n consisting of characters a and/or b.
  
  Let \operatorname{AB}(s) be the number of occurrences of string ab in s as a substring. Analogically, \operatorname{BA}(s) is the number of occurrences of ba in s as a substring.
  
  In one step, you can choose any index i and replace s_i with character a or b.
  
  What is the minimum number of steps you need to make to achieve \operatorname{AB}(s) = \operatorname{BA}(s)?
  
  Reminder:
  
  The number of occurrences of string d in s as substring is the number of indices i (1 ≤ i ≤ |s| - |d| + 1) such that substring s_i s_{i + 1} ... s_{i + |d| - 1} is equal to d. For example, \operatorname{AB}(aabbbabaa) = 2 since there are two indices i: i = 2 where aabbbabaa and i = 6 where aabbbabaa.
  
  Input
  
  Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 1000). Description of the test cases follows.
  
  The first and only line of each test case contains a single string s (1 ≤ |s| ≤ 100, where |s| is the length of the string s), consisting only of characters a and/or b.
  
  Output
  
  For each test case, print the resulting string s with \operatorname{AB}(s) = \operatorname{BA}(s) you'll get making the minimum number of steps.
  
  If there are multiple answers, print any of them.
  
  Example
  
  Input
  
  
  4
  b
  aabbbabaa
  abbb
  abbaab
  
  
  Output
  
  
  b
  aabbbabaa
  bbbb
  abbaaa
  
  Note
  
  In the first test case, both \operatorname{AB}(s) = 0 and \operatorname{BA}(s) = 0 (there are no occurrences of ab (ba) in b), so can leave s untouched.
  
  In the second test case, \operatorname{AB}(s) = 2 and \operatorname{BA}(s) = 2, so you can leave s untouched. 
  
  In the third test case, \operatorname{AB}(s) = 1 and \operatorname{BA}(s) = 0. For example, we can change s_1 to b and make both values zero.
  
  In the fourth test case, \operatorname{AB}(s) = 2 and \operatorname{BA}(s) = 1. For example, we can change s_6 to a and make both values equal to 1.
solution:  import java.util.*;
   import java.lang.*;
   import java.io.*;
  
  public class A_AB_Balance
   {
       static int M = 1_000_000_007;
       static final PrintWriter out =new PrintWriter(System.out);
       static final FastReader fs = new FastReader();
       static boolean prime[];
       public static void main (String[] args) throws java.lang.Exception
       {
             
             int t= fs.nextInt();
             for(int i=0;i<t;i++)
             {
                 char c[]=fs.nextLine().toCharArray();
                 int x=0;
                 for(int j=0;j<c.length-1;j++){
                     if(c[j]!=c[j+1])x++;
                 }
                 if(x%2==0){
                     for(int j=0;j<c.length;j++)out.print(c[j]);
                     out.println();
                 }else{
                     for(int j=0;j<c.length-1;j++)out.print(c[j]);
                     if(c[c.length-1]=='a')
                     out.print('b');
                     else
                     out.print('a');
                     out.println();
                 }
                 
             }
             out.flush();
    }
    public static long power(long x, long y)
    {
        long temp;
        if (y == 0)
            return 1;
        temp = power(x, y / 2);
  
        if (y % 2 == 0)
            return modMult(temp,temp);
        else {
            if (y > 0)
                return modMult(x,modMult(temp,temp));
            else
                return (modMult(temp,temp)) / x;
        }
    }
    static void sieveOfEratosthenes(int n)
      {
           prime = new boolean[n + 1];
          for (int i = 0; i <= n; i++)
              prime[i] = true;
              prime[0]=false;
              if(1<=n)
              prime[1]=false;
          for (int p = 2; p * p <= n; p++)
          {
              
              if (prime[p] == true)
              {
                 
                  for (int i = p * p; i <= n; i += p)
                      prime[i] = false;
              }
          }
      }
           static class FastReader 
           {
           BufferedReader br;
           StringTokenizer st;
    
           public FastReader()
           {
               br = new BufferedReader(
                   new InputStreamReader(System.in));
           }
    
           String next()
           {
               while (st == null || !st.hasMoreElements()) {
                   try {
                       st = new StringTokenizer(br.readLine());
                       }
                   catch (IOException e) {
                       e.printStackTrace();
                       }
           }
               return st.nextToken();
           }
    
           int nextInt() { return Integer.parseInt(next()); }
    
           long nextLong() { return Long.parseLong(next()); }
    
           double nextDouble()
           {
               return Double.parseDouble(next());
           }
    
           String nextLine()
           {
               String str = "";
               try {
                   str = br.readLine();
               }
               catch (IOException e) {
                   e.printStackTrace();
               }
               return str;
           }
   int [] arrayIn(int n) throws IOException
       {
           int  arr[] = new int[n];
           for(int i=0; i<n; i++)
           {
               arr[i] = nextInt();
           }
           return arr;
       }
       }
       
       public static class Pairs implements Comparable<Pairs>
       {
           int value,index;
           Pairs(int value, int index)
           {
               this.value = value;
               this.index = index;
           }
           public int compareTo(Pairs p)
           {
               return Integer.compare(this.value, p.value);
           }
       }
       static final Random random = new Random();
    
       static void ruffleSort(int arr[])
       {
           int n = arr.length;
           for(int i=0; i<n; i++)
           {
               int j = random.nextInt(n),temp = arr[j];
               arr[j] = arr[i];
               arr[i] = temp;
           }
           Arrays.sort(arr);
       }
       static long nCk(int n, int k) {
           return (modMult(fact(n),fastexp(modMult(fact(n-k),fact(k)),M-2)));
       }
    
       static long fact (long n) {
    
           long fact =1;
           for(int i=1; i<=n; i++) {
               fact = modMult(fact,i);
           }
           return fact%M;
       }
    
       static long modMult(long a,long b) {
           return a*b%M;
       }
    
       static long fastexp(long x, int y){
           if(y==1) return x;
    
           long ans = fastexp(x,y/2);
           if(y%2 == 0) return modMult(ans,ans);
           else return modMult(ans,modMult(ans,x));
       }
   }