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.DataInputStream; 
// import java.io.FileInputStream;
// import java.io.IOException;1
// import java.util.Arrays;
// import java.util.HashSet;
// import java.util.Scanner;
// import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;

import javax.swing.plaf.synth.SynthSplitPaneUI;
public class G
{ 
// 	static class Reader 
// 	{ 
// 		final private int BUFFER_SIZE = 1 << 16; 
// 		private DataInputStream din; 
// 		private byte[] buffer; 
//         private int bufferPointer, bytesRead; 
        
// 		public Reader() 
// 		{ 
// 			din = new DataInputStream(System.in); 
// 			buffer = new byte[BUFFER_SIZE]; 
// 			bufferPointer = bytesRead = 0; 
// 		} 

// 		public Reader(String file_name) throws IOException 
// 		{ 
// 			din = new DataInputStream(new FileInputStream(file_name)); 
// 			buffer = new byte[BUFFER_SIZE]; 
// 			bufferPointer = bytesRead = 0; 
// 		} 

// 		public String nextLine() throws IOException 
// 		{ 
// 			byte[] buf = new byte[101]; // line length 
// 			int cnt = 0, c; 
// 			while ((c = next()) != -1) 
// 			{ 
// 				if (c == '\n') 
// 					break; 
// 				buf[cnt++] = (byte) c; 
// 			} 
// 			return new String(buf, 0, cnt); 
// 		} 

// 		public int nextInt() throws IOException 
// 		{ 
// 			int ret = 0; 
// 			byte c = next(); 
// 			while (c <= ' ') 
// 				c = next(); 
// 			boolean neg = (c == '-'); 
// 			if (neg) 
// 				c = next(); 
// 			do
// 			{ 	
// 				ret = ret * 10 + c - '0'; 
// 			} while ((c = next()) >= '0' && c <= '9'); 

// 			if (neg) 
// 				return -ret; 	
// 			return ret; 
// 		} 

// 		public long nextLong() throws IOException 
// 		{ 
// 			long ret = 0; 
// 			byte c = next(); 
// 			while (c <= ' ') 
// 				c = next(); 
// 			boolean neg = (c == '-'); 
// 			if (neg) 
// 				c = next(); 
// 			do { 
// 				ret = ret * 10 + c - '0'; 
// 			} 
// 			while ((c = next()) >= '0' && c <= '9'); 
// 			if (neg) 
// 				return -ret; 
// 			return ret; 
// 		} 

// 		public double nextDouble() throws IOException 
// 		{ 
// 			double ret = 0, div = 1; 
// 			byte c = next(); 
// 			while (c <= ' ') 
// 				c = next(); 
// 			boolean neg = (c == '-'); 
// 			if (neg) 
// 				c = next(); 

// 			do { 
// 				ret = ret * 10 + c - '0'; 
// 			} 
// 			while ((c = next()) >= '0' && c <= '9'); 

// 			if (c == '.') 
// 			{ 
// 				while ((c = next()) >= '0' && c <= '9') 
// 				{ 
// 					ret += (c - '0') / (div *= 10); 
// 				} 
// 			} 

// 			if (neg) 
// 				return -ret; 
// 			return ret; 
// 		} 

// 		private void fillBuffer() throws IOException 
// 		{ 
// 			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
// 			if (bytesRead == -1) 
// 				buffer[0] = -1; 
// 		} 

// 		private byte next() throws IOException 
// 		{ 
// 			if (bufferPointer == bytesRead) 
// 				fillBuffer(); 
// 			return buffer[bufferPointer++]; 
// 		} 

// 		public void close() throws IOException 
// 		{ 
// 			if (din == null) 
// 				return; 
// 			din.close(); 
// 		} 
// 	} 

	public static void main(String[] args) 
	{ 
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		while(t-->0){
			String s = sc.next();
			HashSet<Character> hs = new HashSet<>();
			for(int i = 0; i<s.length(); i++){
				hs.add(s.charAt(i));
			}
			if(hs.size()==1) System.out.println(s);
			else{
				for(int i = 0; i<s.length(); i++) {
					System.out.print(0);
					System.out.print(1);
				}
				System.out.println();
			}
		}
	}
}