package quardtree;

import java.util.Scanner;


public class Main {
    static int current=0;
    static int depth = 0;
    static String[] input = new String[50];
    static String[] output = new String[50];

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int caseNum = sc.nextInt();

        for(current=0; current<caseNum; current++){
            Scanner sc2 = new Scanner(System.in);
            input[current] =sc2.nextLine();
            if(input[current].charAt(0)=='x')
                output[current] = changeDraw(0);
            else
                output[current] = input[current];
            depth = 0;
        }

        for(int i=0; i<caseNum; i++)
            System.out.println(output[i]);
        return;
    }

    public static String changeDraw(int index){
        String temp ="";
        String result="x";
        int mid=0;          //중간
        int len=0;
        index++;            //끝 +1
        int count=0;    //4번씩 카운트
        String temp2="";
        while(count<4){
            if(input[current].charAt(index)== 'x'){
                temp2 = changeDraw(index);
                len+= temp2.length();
                index+= temp2.length();
                temp +=temp2;
            }
            else{
                temp += input[current].charAt(index);
                len += 1;
                index +=1;
            }
            count++;
            if(count==2)
                mid=len;
        }
        result +=temp.substring(mid, len);
        result +=temp.substring(0, mid);
        return result;
    }
}