#include<iostream>
#include<string>
#include<deque>
using namespace std;

string cutString(string input, int from, int to) {
    string result;
    for (int i = from; i < to; i++) {
        result += input[i];
    }
    return result;
}

int findLen(string input) {
    if (input[0] != 'x') return 1;
    int position = 1;
    deque<int> list;
    list.push_back(0);
    while (!list.empty()) {
        if (input[position] == 'x') list.push_back(0);
        else {
            list.back()++;
            if (list.back() == 4) {
                list.pop_back();
                if (!list.empty()) list.back()++;
            }
        }
        position++;
    }
    return position;
}

string solve(string input) {
    if (input.size() == 1) return input;
    int position = 1;
    int LUfrom = 0, LUto = 0, RUfrom = 0, RUto = 0, LDfrom = 0, LDto = 0, RDfrom = 0, RDto = 0;
    LUfrom = position;
    LUto = position += findLen(cutString(input, LUfrom, input.size()));
    RUfrom = position;
    RUto = position += findLen(cutString(input, RUfrom, input.size()));
    LDfrom = position;
    LDto = position += findLen(cutString(input, LDfrom, input.size()));
    RDfrom = position;
    RDto = position += findLen(cutString(input, RDfrom, input.size())); 
    return ('x' + solve(cutString(input, LDfrom, LDto)) + solve(cutString(input, RDfrom, RDto)) + solve(cutString(input, LUfrom, LUto)) + solve(cutString(input, RUfrom, RUto)));
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        string input;
        cin >> input;
        cout << solve(input) << endl;
    }
}