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.
//---#ON_MY_WAY---
import static java.lang.Math.*;
import java.io.*;
import java.math.*;
import java.util.*;

public class apples {
	static FastReader x = new FastReader();
	static OutputStream outputStream = System.out;
	static PrintWriter out = new PrintWriter(outputStream);

	/*---------------------------------------CODE STARTS HERE-------------------------*/
	public static void main(String[] args) {

		int t = x.nextInt();
		StringBuilder str = new StringBuilder();
		while (t > 0) {
			String s=x.next();
			int cz=0,co=0;
			for (int i = 0; i < s.length(); i++) {
				if(s.charAt(i)=='0') cz++;
				else co++;
			}
			if(cz==0||co==0) {
				str.append(s);
			}
			else {
				int f=0;
				if(s.charAt(0)=='1') {
					f=1;
				}
				int n=s.length();
				for (int i = 0; i < 2*n; i++) {
					str.append(f);
					f=f^1;
				}
			}
			str.append("\n");
			t--;
		}
		out.println(str);
		out.flush();
	}

	/*--------------------------------------------FAST I/O--------------------------------*/
	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;
		}

		char nextchar() {
			char ch = ' ';
			try {
				ch = (char) br.read();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return ch;
		}
	}

	/*--------------------------------------------BOILER PLATE---------------------------*/
	static int[] readarr(int n) {
		int arr[] = new int[n];
		for (int i = 0; i < n; i++) {
			arr[i] = x.nextInt();
		}
		return arr;
	}

	static int[] sort(int a[]) {
		ArrayList<Integer> al = new ArrayList<>();
		for (int i : a) {
			al.add(i);
		}
		Collections.sort(al);
		for (int i = 0; i < a.length; i++) {
			a[i] = al.get(i);
		}
		return a;
	}
	
	static int pow(int x, int y) {
		int result = 1;
		while (y > 0) {
			if (y % 2 == 0) {
				x = x * x;
				y = y / 2;
			} else {
				result = result * x;
				y = y - 1;
			}
		}
		return result;
	}
	
	static int[] revsort(int a[]) {
		ArrayList<Integer> al = new ArrayList<>();
		for (int i : a) {
			al.add(i);
		}
		Collections.sort(al, Comparator.reverseOrder());
		for (int i = 0; i < a.length; i++) {
			a[i] = al.get(i);
		}
		return a;
	}

	static int[] gcd(int a, int b, int ar[]) {
		if (b == 0) {
			ar[0] = a;
			ar[1] = 1;
			ar[2] = 0;
			return ar;
		}
		ar = gcd(b, a % b, ar);
		int t = ar[1];
		ar[1] = ar[2];
		ar[2] = t - (a / b) * ar[2];
		return ar;
	}

	static boolean[] esieve(int n) {
		boolean p[] = new boolean[n + 1];
		Arrays.fill(p, true);
		for (int i = 2; i * i <= n; i++) {
			if (p[i] == true) {
				for (int j = i * i; j <= n; j += i) {
					p[j] = false;
				}
			}
		}
		return p;
	}

	static ArrayList<Integer> primes(int n) {
		boolean p[] = new boolean[n + 1];
		ArrayList<Integer> al = new ArrayList<>();
		Arrays.fill(p, true);
		int i = 0;
		for (i = 2; i * i <= n; i++) {
			if (p[i] == true) {
				al.add(i);
				for (int j = i * i; j <= n; j += i) {
					p[j] = false;
				}
			}
		}
		for (i = i; i <= n; i++) {
			if (p[i] == true) {
				al.add(i);
			}
		}
		return al;
	}

	static int etf(int n) {
		int res = n;
		for (int i = 2; i * i <= n; i++) {
			if (n % i == 0) {
				res /= i;
				res *= (i - 1);
				while (n % i == 0) {
					n /= i;
				}
			}
		}
		if (n > 1) {
			res /= n;
			res *= (n - 1);
		}
		return res;
	}
	
	static int gcd(int a,int b) {
		if(a==0) {
			return a;
		}
		return gcd(b%a,a);
	}
}