#include <stdio.h>
//#include <time.h>

int TC;
char str[1000+1];
unsigned long strlen;
char tree[21][1099511627776]; // 컴파일 에러 나는 부분입니다.
int depth;
unsigned long loc[21];

void makeTree(void)
{
    for(int j=0;j<strlen;j++)
    {
        switch(str[j])
        {
            case 'x':
                {
                    tree[depth][loc[depth]] = 'x';
                    depth += 1;
                    loc[depth] = loc[depth-1]*4;
                }
                break;
            case 'w':
                {
                    tree[depth][loc[depth]] = 'w';
                    if((loc[depth]+1)%4 == 0) depth--;
                    loc[depth] += 1;
                }
                break;
            case 'b':
                {
                    tree[depth][loc[depth]] = 'b';
                    if((loc[depth]+1)%4 == 0) depth--;
                    loc[depth] += 1;
                }
                break;
        }
    }
}

void searchTree(void)
{
    // only 1 node
    if(tree[0][0] != 'x') {
        printf("%c",tree[0][0]);
        return;
    }

    printf("x");
    depth = 1;
    loc[depth] = 2;
    for(int i=0;i<strlen-1;i++) // because of first 'x', condition is "i<strlen-1" 
    {
        switch(tree[depth][loc[depth]])
        {
            case 'x':
                {
                    printf("x");
                    depth += 1;
                    loc[depth] = loc[depth-1]*4+2;
                }
                break;
            case 'w':
                {
                    printf("w");
                    if((loc[depth]+3)%4 == 0) depth--;
                    loc[depth] += 1;
                    if(loc[depth]%4 == 0) loc[depth] -= 4;
                }
                break;
            case 'b':
                {
                    printf("b");
                    if((loc[depth]+3)%4 == 0) depth--;
                    loc[depth] += 1;
                    if(loc[depth]%4 == 0) loc[depth] -= 4;
                }
                break;
        }
    }
}

int main(void)
{
    //clock_t st = clock();
    freopen("input.txt", "r", stdin);
    //setbuf(stdout, NULL);

    scanf("%d",&TC);
    for(int i=0;i<TC;i++)
    {
        // init
        for(int j=0;j<1001;j++)
            str[j] = 0;
        strlen = 0;
        for(int j=0;j<11;j++)
            for(int k=0;k<1048576;k++)
                tree[j][k] = 0;
        for(int j=0;j<11;j++)
            loc[j] = 0;
        depth = 0;

        // input str
        scanf("%s",&str);
        for(char* ptr = str;*ptr!=0;ptr++)
            strlen++;

        makeTree();

        // init
        for(int j=0;j<11;j++)
            loc[j] = 0;
        depth = 0;

        searchTree();   // DFS by 34,12 order
        printf("\n");
    }

    //printf("time : %d\n",clock()-st);

    return 0;
}