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 Codechef {
  	public static void main(String[] args) throws java.lang.Exception {
  		FastReader in = new FastReader(System.in);
  		StringBuilder sb = new StringBuilder();
  		int t = 1;
  		t = in.nextInt();
  		while (t > 0) {
  			--t;
            char arr[]  = in.next().toCharArray();
            if(check(arr)) {
          	  sb.append(new String(arr)+"\n");
          	  continue;
            }
            for(int i = 0;i<arr.length;i++)
            {
          	  char temp = arr[i];
          	  if(temp == 'a')
          		  arr[i] = 'b';
          	  else 
          		  arr[i] = 'a';
          	  if(check(arr))
          	  {
          		  sb.append(new String(arr)+"\n");
          		  break;
          	  }
          	  arr[i] = temp;
            }
            
  		}
  		System.out.print(sb);
  	}
  
  	static boolean check(char arr[])
  	{
  		int count1 = 0;
  		int count2 = 0;
  		for(int i = 0;i<arr.length-1;i++)
  		{
  			if(arr[i] == 'a' && arr[i+1] == 'b')
  				++count1;
  		    if(arr[i] == 'b' && arr[i+1] == 'a')
  		    	++count2;
  		}
  		return count1 == count2;
  	}
  	static long gcd(long a, long b) {
  		if (a == 0)
  			return b;
  		else
  			return gcd(b % a, a);
  	}
  
  	static long lcm(long a, long b) {
  		return (a / gcd(a, b)) * b;
  	}
  
  	static void sort(long[] a) {
  		ArrayList<Long> l = new ArrayList<>();
  		for (long i : a)
  			l.add(i);
  		Collections.sort(l);
  		for (int i = 0; i < a.length; i++)
  			a[i] = l.get(i);
  	}
  }
  
  class FastReader {
  
  	byte[] buf = new byte[2048];
  	int index, total;
  	InputStream in;
  
  	FastReader(InputStream is) {
  		in = is;
  	}
  
  	int scan() throws IOException {
  		if (index >= total) {
  			index = 0;
  			total = in.read(buf);
  			if (total <= 0) {
  				return -1;
  			}
  		}
  		return buf[index++];
  	}
  
  	String next() throws IOException {
  		int c;
  		for (c = scan(); c <= 32; c = scan())
  			;
  		StringBuilder sb = new StringBuilder();
  		for (; c > 32; c = scan()) {
  			sb.append((char) c);
  		}
  		return sb.toString();
  	}
  
  	String nextLine() throws IOException {
  		int c;
  		for (c = scan(); c <= 32; c = scan())
  			;
  		StringBuilder sb = new StringBuilder();
  		for (; c != 10 && c != 13; c = scan()) {
  			sb.append((char) c);
  		}
  		return sb.toString();
  	}
  
  	char nextChar() throws IOException {
  		int c;
  		for (c = scan(); c <= 32; c = scan())
  			;
  		return (char) c;
  	}
  
  	int nextInt() throws IOException {
  		int c, val = 0;
  		for (c = scan(); c <= 32; c = scan())
  			;
  		boolean neg = c == '-';
  		if (c == '-' || c == '+') {
  			c = scan();
  		}
  		for (; c >= '0' && c <= '9'; c = scan()) {
  			val = (val << 3) + (val << 1) + (c & 15);
  		}
  		return neg ? -val : val;
  	}
  
  	long nextLong() throws IOException {
  		int c;
  		long val = 0;
  		for (c = scan(); c <= 32; c = scan())
  			;
  		boolean neg = c == '-';
  		if (c == '-' || c == '+') {
  			c = scan();
  		}
  		for (; c >= '0' && c <= '9'; c = scan()) {
  			val = (val << 3) + (val << 1) + (c & 15);
  		}
  		return neg ? -val : val;
  	}
  }