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.
from sys import stdin
#from collections import Counter
#from math import ceil,log

def list_int():
	s=stdin.readline()[:-1]
	return list(map(int, s.split()))
def list_float():
	s=stdin.readline()[:-1]
	return list(map(float, s.split()))
def list_str():
	s=stdin.readline()[:-1]
	return list(s.split())
def space_int():
	s=stdin.readline()[:-1]
	return map(int, s.split())
def space_float():
	s=stdin.readline()[:-1]
	return map(float, s.split())
def space_str():
	s=stdin.readline()[:-1]
	return s.split()
def _int():
	s=stdin.readline()[:-1]
	return int(s)
def _str():
	s=stdin.readline()[:-1]
	return s
def _float():
	s=stdin.readline()[:-1]
	return float(s)
def _gcd(a, b):
	if(a==0):
		return b 
	return _gcd(b%a,a)
def _sieve(n): 
	prime=[True for i in range(n+1)]
	p=2
	while(p*p<=n): 
		if (prime[p]==True): 
			for i in range(p*p,n+1,p): 
				prime[i]=False
		p+=1
	prime[0]=False
	prime[1]=False
	return prime 

alpha=['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
nums=[0,1,2,3,4,5,6,7,8,9]
maxi=-(2**32)
mini=2**32
mod=10**9+7

#_______________________________________________________________________________________________________________________________________

for _ in range(int(input())):
	t=_str()
	x=t.count('1')
	y=t.count('0')
	if(x==0):
		print(t)
	elif(y==0):
		print(t)
	else:
		s='01'*len(t)
		print(s)