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.
1
abbabababbabababbababbbabbbbabbbabaabaabba
 4
b
aabbbabaa
abbb
abbaab
 1
aaaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbab

abbabababbabababbababbbabbbbabbbabaabaabba
 b
aabbbabaa
bbbb
bbbaab
 baaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbab

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.StringTokenizer;

public class JavaApplication1 {

    static ArrayList<String> arr = new ArrayList<>();
    static int num = 0;
    static long mod = (long) 1e9 + 7;

    public static void main(String[] args) throws IOException {
        BufferedWriter print = new BufferedWriter(new OutputStreamWriter(System.out));
        fast in = new fast();
        int t = in.nextInt();
        while (t-- != 0) {
            String str = in.next();
            int n = str.length();
            long count = 0;
            for (int i = 0; i < n - 1; i++) {
                if (str.charAt(i) == 'a' && str.charAt(i + 1) == 'b') {
                    count++;
                } else if (str.charAt(i) == 'b' && str.charAt(i + 1) == 'a') {
                    count--;
                }
            }
            if (count == 0) {
                System.out.println(str);
            } else if (count == 1) {
                for (int i = 0; i < n - 1; i++) {
                    System.out.print(str.charAt(i));
                }
                System.out.print("a\n");
            } else {
                for (int i = 0; i < n - 1; i++) {
                    System.out.print(str.charAt(i));
                }
                System.out.print("b\n");
            }
        }
    }

    public static long binpow(long a, long b) {
        a %= mod;
        long out = 1;
        while (b > 0) {
            if ((b & 1) != 1) {
            } else {
                out = (out * a % mod);
            }
            a = (a * a % mod);
            b >>= 1;
        }
        return out;
    }

    static long LowerBound(long a[], long x) {
        long l = -1, r = a.length;
        while (l + 1 < r) {
            long m = (l + r) >>> 1;
            if (a[(int) m] >= x) {
                r = m;
            } else {
                l = m;
            }
        }
        return r;
    }

    public static boolean isPrime(long num) {
        if (num <= 1) {
            return false;
        } else {
            long sq = (long) Math.sqrt(num) + 1;
            for (long i = 2; i < sq; i++) {
                if (num % i == 0) {
                    return false;
                }
            }
            return true;
        }
    }

    public static boolean checkPalindrome(String x) {
        String temp = "";
        if (x.length() % 2 == 0) {
            for (int i = x.subSequence(x.length() / 2, x.length()).length() - 1; i >= 0; i--) {
                temp += x.subSequence(x.length() / 2, x.length()).charAt(i);
            }
            return x.substring(0, x.length() / 2).equals(temp);
        } else {
            for (int i = x.subSequence(x.length() / 2, x.length()).length() - 1; i > 0; i--) {
                temp += x.subSequence(x.length() / 2, x.length()).charAt(i);
            }
            return x.substring(0, x.length() / 2).equals(temp);
        }
    }

    public static boolean isVowel(char c) {
        if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') {
            return true;
        } else {
            return false;
        }
    }

    public static void sub(String s, String ans) {
        if (s.length() == 0) {
            arr.add(ans);
            return;
        }
        sub(s.substring(1), ans + s.charAt(0));
        sub(s.substring(1), ans);
    }

    public static long gcd(long a, long b) {
        if (a == 0) {
            return b;
        }
        return gcd(b % a, a);
    }

    public static long lcm(long a, long b) {
        return (a / gcd(a, b)) * b;
    }

    static class fast {

        BufferedReader br;
        StringTokenizer st;

        public fast() {
            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());
        }

        double nextFloat() {
            return Float.parseFloat(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}