import java.util.HashMap;
import java.util.Scanner;

public class Main {

    static int T;

    public static void main(String[] args) throws Exception {

        Scanner sc = new Scanner(System.in);

        T = Integer.parseInt(sc.nextLine());

        for(int testCase = 1; testCase <= T; testCase++) {

            String read = sc.nextLine();

            char myChar;            
            int ixMain = 0, ixSub = 0;
            String ixKey = "";
            // riginal quadtree의 x에 대한 정보를 가진 map  
            HashMap<String, char[]> map = new HashMap<String, char[]>();    
            // original quadtree의 상하반전 결과 map
            HashMap<String, char[]> nMap = new HashMap<String, char[]>();   

            if(read.length() == 1) {    // 1자리는 그냥 출력
                // Answer
                System.out.println(read);
            }
            else {
                do {
                    myChar = read.charAt(ixMain);
                    if( myChar == 'x' ) {   // x이면
                        if( ixKey.length() > 0 ) {
                            char arr[] = map.get(ixKey);
                            arr[ixSub] = myChar;
                        }
                        ixKey += ixSub;
                        map.put(ixKey, new char[4]);
                        ixSub = 0;
                        continue;
                    } 
                    else {
                        char arr[] = map.get(ixKey);
                        arr[ixSub++] = myChar;

                        if( ixSub == 4 ) {
                            // arr
                            char nArr[] = new char[arr.length];
                            for(int i = 0; i < arr.length; i++) {
                                nArr[reflect(i)] = arr[i];
                            }
                            // key
                            char nKey[] = ixKey.toCharArray();
                            for(int i = 1; i < nKey.length; i++) {
                                nKey[i] = Character.forDigit(reflect(Character.getNumericValue(nKey[i])), 10);
                            }
                            // nMap 에 적재
                            nMap.put(String.valueOf(nKey), nArr);
                            ixSub = Integer.parseInt(ixKey.substring(ixKey.length()-1)) + 1;
                            ixKey = ixKey.substring(0, ixKey.length()-1);
                        }
                    }

                } while ( ++ixMain < read.length() );

                // 답안작성
                int index = 0;
                ixKey = String.valueOf(index);
                StringBuffer buff = new StringBuffer("x");
                do {
                    char arr[] = nMap.get(ixKey);
                    buff.append(arr[index]);
                    if( 'x' == arr[index] ) {
                        ixKey += index;
                        index = 0;
                    }
                    else {
                        if(++index == 4) {
                            if(ixKey.length() > 1) {
                                index = Integer.parseInt(ixKey.substring(ixKey.length()-1)) + 1;
                                ixKey = index == 4? "END" : ixKey.substring(0, ixKey.length()-1);
                            }
                            else {
                                ixKey = "END";
                            }
                        }
                    }
                } while( ixKey != "END" );
                // Answer
                System.out.println(buff.toString());
            }
        }
        sc.close();
    }

    /* 상하반전을 위한 변경
     * 0,1,2,3 분면 -(반전)-> 2,3,0,1
     */
    private static int reflect(int val) {
        int result = 0;
        switch(val) {
        case 0: 
            result = 2;
            break;
        case 1: 
            result = 3;
            break;
        case 2: 
            result = 0;
            break;
        case 3: 
            result = 1;
            break;
        }
        return result;
    }
}