#include <iostream>

using namespace std;

#define MAX_LENGTH 2000

typedef struct node{
    char data;
    struct node* a1;
    struct node* a2;
    struct node* a3;
    struct node* a4;
} Node;

int Case = 0;
int T;

char text[MAX_LENGTH+1] = {0,};
Node* a1 = 0;
Node* a2 = 0;
Node* a3 = 0;
Node* a4 = 0;

Node* tree;

void quad(Node* node);
int find(int index, int label, Node* node);

int main()
{
    if(freopen("sample.txt", "r", stdin) == NULL) return 0;

    scanf("%d", &T);

    while(Case<T)
    {
        tree = new Node;
        tree->data = 'x';
        tree->a1 = NULL;
        tree->a2 = NULL;
        tree->a3 = NULL;
        tree->a4 = NULL;

        a1 = 0;
        a2 = 0;
        a3 = 0;
        a4 = 0;
        scanf("%s",text);

        printf("%c",text[0]);

        find(1,0, tree);

        quad(a3);
        quad(a4);
        quad(a1);
        quad(a2);

        printf("\n");
        Case++;
        free(tree);
    }
    return 0;
}

int find(int index, int label, Node* node)
{
    int i;
    for( i=label ; i<label+4; i++)
    {
        Node* nd = new Node;
        nd->data = text[index];
        nd->a1 = NULL;
        nd->a2 = NULL;
        nd->a3 = NULL;
        nd->a4 = NULL;

        if(text[index]=='x')
        {
            index = find(index+1,(label+10)/10*10, nd);
        }

        if((i-label)%4==0){
            node->a1 = nd;
        }else if((i-label)%4==1){
            node->a2 = nd;
        }else if((i-label)%4==2){
            node->a3 = nd;
        }else if((i-label)%4==3){
            node->a4 = nd;
        }

        if(i==0) a1 = nd;
        if(i==1) a2 = nd;
        if(i==2) a3 = nd;
        if(i==3) {a4 = nd; }

        index++;
    }
    if(i==label+4) index--;
    return index;

}

void quad(Node* node)
{
    if(node->data=='x')
    {
        printf("x");
        if(node->a3->data=='x'){
            quad(node->a3);
        }else{
            printf("%c",node->a3->data);
            free(node->a3);
        }
        if(node->a4->data=='x'){
            quad(node->a4);
        }else{
            printf("%c",node->a4->data);
            free(node->a4);
        }
        if(node->a1->data=='x'){
            quad(node->a1);
        }else{
            printf("%c",node->a1->data);
            free(node->a1);
        }
        if(node->a2->data=='x'){
            quad(node->a2);
        }else{
            printf("%c",node->a2->data);
            free(node->a2);
        }
    }else{
        printf("%c",node->data);
        free(node);
    }
}