Let's say string s has period k if s_i = s_{i + k} for all i from 1 to |s| - k (|s| means length of string s) and k is the minimum positive integer with this property.

Some examples of a period: for s="0101" the period is k=2, for s="0000" the period is k=1, for s="010" the period is k=2, for s="0011" the period is k=4.

You are given string t consisting only of 0's and 1's and you need to find such string s that:

  1. String s consists only of 0's and 1's; 
  2. The length of s doesn't exceed 2 ⋅ |t|; 
  3. String t is a subsequence of string s; 
  4. String s has smallest possible period among all strings that meet conditions 1—3. 



Let us recall that t is a subsequence of s if t can be derived from s by deleting zero or more elements (any) without changing the order of the remaining elements. For example, t="011" is a subsequence of s="10101".

Input

The first line contains single integer T (1 ≤ T ≤ 100) — the number of test cases.

Next T lines contain test cases — one per line. Each line contains string t (1 ≤ |t| ≤ 100) consisting only of 0's and 1's.

Output

Print one string for each test case — string s you needed to find. If there are multiple solutions print any one of them.

Example

Input


4
00
01
111
110


Output


00
01
11111
1010

Note

In the first and second test cases, s = t since it's already one of the optimal solutions. Answers have periods equal to 1 and 2, respectively.

In the third test case, there are shorter optimal solutions, but it's okay since we don't need to minimize the string s. String s has period equal to 1.
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;

public class codeforceseducational {

   static class FastReader {
        BufferedReader br;
        StringTokenizer st;

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

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    public static void main(String[] args) {
//        Scanner s=new Scanner(System.in);
        FastReader s=new FastReader();
        int a =s.nextInt();
        for(int i=0;i<a;i++){
            String str=s.next();
            boolean allzero=true;
            boolean allone=true;
            for(int j=0;j<str.length();j++)
                if(str.charAt(j)=='0')
                    allone=false;
                else if(str.charAt(j)=='1')
                    allzero=false;
                if(allzero||allone)
                    System.out.println(str);
                else{
//                    System.out.println("heu");
                    StringBuilder sb=new StringBuilder();
                    for(int j=0;j<2*str.length();j+=2)
                        sb.append("01");
                    System.out.println(sb.toString());
                }
//            long b=s.nextInt();
//            long c=s.nextInt();
//            long d=s.nextInt();
//            long e=s.nextInt();
//            long ans=0;
//            ans=Math.min((b+c)*d,Math.min(b,c)*e+(Math.max(b,c)-Math.min(b,c))*d);
//            System.out.println(ans);
//            String d=s.next();
//            int arr[]=new int[b];
//            for(int j=0;j<b;j++)
//                arr[j]=s.nextInt();
//            for(int j=0;j<b;j++){
//
//            }
        }
    }
}
