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.io.*;
  
  public class a{
  
      public static void main(String[] args){
          JS scan = new JS();
          PrintWriter out = new PrintWriter(System.out);
          int t = scan.nextInt();
          for(int q = 1; q <= t; q++){
              char[] s = scan.next().toCharArray();
              int ab = 0;
              int ba = 0;
              for(int i = 0; i < s.length-1; i++){
                  if(s[i] == 'a' && s[i+1] == 'b'){
                      ab++;
                  }
                  else if(s[i] == 'b' && s[i+1] == 'a'){
                      ba++;
                  }
              }
  
              if(ab != ba){
                  if(s[0] == 'b') s[0] = 'a';
                  else s[0] = 'b';
              }
  
              
              for(int i = 0; i < s.length; i++) out.print(s[i]);
              out.println();
          }
          out.flush();
      }
  
      static class JS {
          public int BS = 1<<16;
          public char NC = (char)0;
          byte[] buf = new byte[BS];
          int bId = 0, size = 0;
          char c = NC;
          double num = 1;
          BufferedInputStream in;
   
          public JS() {
              in = new BufferedInputStream(System.in, BS);
          }
   
          public JS(String s) throws FileNotFoundException {
              in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
          }
   
          public char nextChar(){
              while(bId==size) {
                  try {
                      size = in.read(buf);
                  }catch(Exception e) {
                      return NC;
                  }
                  if(size==-1)return NC;
                  bId=0;
              }
              return (char)buf[bId++];
          }
   
          public int nextInt() {
              return (int)nextLong();
          }
   
          public long nextLong() {
              num=1;
              boolean neg = false;
              if(c==NC)c=nextChar();
              for(;(c<'0' || c>'9'); c = nextChar()) {
                  if(c=='-')neg=true;
              }
              long res = 0;
              for(; c>='0' && c <='9'; c=nextChar()) {
                  res = (res<<3)+(res<<1)+c-'0';
                  num*=10;
              }
              return neg?-res:res;
          }
   
          public double nextDouble() {
              double cur = nextLong();
              return c!='.' ? cur:cur+(cur < 0 ? -1*nextLong()/num : nextLong()/num);
          }
   
          public String next() {
              StringBuilder res = new StringBuilder();
              while(c<=32)c=nextChar();
              while(c>32) {
                  res.append(c);
                  c=nextChar();
              }
              return res.toString();
          }
      }
  }