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.io.*;
  import java.math.BigInteger;
  import java.util.*;
  
  public class Main {
  
      public static void main(String[] args) {
          FastReader scan = new FastReader();
          PrintWriter out = new PrintWriter(System.out);
          Solution solve = new Solution();
          int t = 1;
          t = scan.nextInt();
          for (int qq = 0; qq < t; qq++) {
              solve.solve(scan, out);
              out.println();
          }
          out.close();
      }
  
      static class Solution {
          /*
           * think and coding
           */
          public void solve(FastReader scan, PrintWriter out) {
  
              char[] arr = scan.nextLine().toCharArray();
              String s = new String(arr);
              char[] tmp_arr = s.toCharArray();
              int cnt1 = 0, cnt2 = 0;
              for (int i = 0; i < arr.length - 1; i++) {
                  if (arr[i] == 'a' && arr[i + 1] == 'b') {
                      cnt1++;
                      i++;
                  }
              }
              for (int i = 0; i < arr.length - 1; i++) {
                  if (arr[i] == 'b' && arr[i + 1] == 'a') {
                      cnt2++;
                      i++;
                  }
              }
              if (cnt1 == cnt2) {
                  out.print(tmp_arr);
              } else if (cnt1 > cnt2){
                  int cnt = Math.abs(cnt1 - cnt2);
                  for (int i = 0; i < arr.length; i++) {
                      if (arr[i] == 'a' && cnt > 0){
                          arr[i] = 'b';
                          cnt--;
                      }
                  }
                  for (char c : arr) {
                      out.print(c);
                  }
              } else{
                  int cnt = Math.abs(cnt1 - cnt2);
                  for (int i = 0; i < arr.length; i++) {
                      if (arr[i] == 'b' && cnt > 0){
                          arr[i] = 'a';
                          cnt--;
                      }
                  }
                  for (char c : arr) {
                      out.print(c);
                  }
              }
          }
      }
  
      static class FastReader {
          private final BufferedReader br;
          private StringTokenizer st;
  
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          public FastReader(String s) throws FileNotFoundException {
              br = new BufferedReader(new FileReader(new File(s)));
          }
  
          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;
          }
      }
  }