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: // Generated by Code Flattener.
  // https://plugins.jetbrains.com/plugin/9979-idea-code-flattener
  
  import java.io.*;
  import java.util.StringTokenizer;
  
  public class Main {
      public static void main(String[] args) {
          Solution solution = new ASolution();
          boolean local = System.getProperty("ONLINE_JUDGE") == null && !solution.isInteractive();
          String input = local ? "input.txt" : null;
          solution.in = new MyScanner(input);
          solution.out = MyWriter.of(null);
          solution.bm = new Benchmark();
          solution.al = new Algorithm();
          solution.run();
          solution.close();
      }
  
      private abstract static class Solution {
          public MyScanner in;
          public MyWriter out;
          public Benchmark bm;
          public Algorithm al;
  
          public void init() {
          }
  
          public abstract void solve();
  
          protected boolean isMultiTest() {
              return true;
          }
  
          public void run() {
              init();
              if (isMultiTest()) {
                  int t = in.nextInt();
                  for (int i = 0; i < t; i++) {
                      solve();
                  }
              } else {
                  solve();
              }
          }
  
          public void close() {
              out.close();
          }
  
          public boolean isInteractive() {
              return false;
          }
      }
  
      private static class ASolution extends Solution {
          public void solve() {
              String str = in.nextLine();
              int n = str.length();
              out.print(str.substring(0, n - 1));
              out.println(str.charAt(0));
          }
      }
  
      private static class MyScanner {
          private final BufferedReader br;
          private StringTokenizer st;
  
          public MyScanner(String fileName) {
              if (fileName != null) {
                  try {
                      File file = new File(getClass().getClassLoader().getResource(fileName).getFile());
                      br = new BufferedReader(new FileReader(file));
                  } catch (FileNotFoundException e) {
                      throw new RuntimeException(e);
                  }
              } else {
                  br = new BufferedReader(new InputStreamReader(System.in));
              }
          }
  
          public String next() {
              while (st == null || !st.hasMoreElements()) {
                  st = new StringTokenizer(nextLine());
              }
              return st.nextToken();
          }
  
          public int nextInt() {
              return Integer.parseInt(next());
          }
  
          public String nextLine() {
              try {
                  String line = br.readLine();
                  if (line == null) {
                      throw new RuntimeException("empty line");
                  }
                  st = null;
                  return line;
              } catch (IOException e) {
                  throw new RuntimeException(e);
              }
          }
      }
  
      private static class Benchmark {
      }
  
      private static class Algorithm {
      }
  
      private static class MyWriter extends PrintWriter {
          public static MyWriter of(String fileName) {
              if (fileName != null) {
                  try {
                      return new MyWriter(new FileWriter(fileName));
                  } catch (IOException e) {
                      throw new RuntimeException(e);
                  }
              } else {
                  return new MyWriter(new BufferedOutputStream(System.out));
              }
          }
  
          public MyWriter(Writer writer) {
              super(writer);
          }
  
          public MyWriter(OutputStream out) {
              super(out);
          }
      }
  }