write a go solution for Description:
You are given a string s of length n consisting of characters a and/or b.

Let operatornameAB(s) be the number of occurrences of string ab in s as a substring. Analogically, operatornameBA(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 operatornameAB(s)=operatornameBA(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_is_i+1...s_i+|d|-1 is equal to d. For example, operatornameAB(aabbbabaa)=2 since there are two indices i: i=2 where aabbbabaa and i=6 where aabbbabaa.

Input Format:
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 Format:
For each test case, print the resulting string s with operatornameAB(s)=operatornameBA(s) you'll get making the minimum number of steps.

If there are multiple answers, print any of them.

Note:
In the first test case, both operatornameAB(s)=0 and operatornameBA(s)=0 (there are no occurrences of ab (ba) in b), so can leave s untouched.

In the second test case, operatornameAB(s)=2 and operatornameBA(s)=2, so you can leave s untouched.

In the third test case, operatornameAB(s)=1 and operatornameBA(s)=0. For example, we can change s_1 to b and make both values zero.

In the fourth test case, operatornameAB(s)=2 and operatornameBA(s)=1. For example, we can change s_6 to a and make both values equal to 1.. Output only the code with no comments, explanation, or additional text.