#include<bits/stdc++.h>

 using namespace std;

 struct Node{

     int num;//储存状态

     vector<int> path;//储存操作

 };

 int visit[];

 int click(int i, int num){

     int tmp = ;

     switch(i){

         case :tmp = num ^ ; break;//点击第0位，则0、1、3、4位取反，这里用异或实现，点击其他的同理

         case :tmp = num ^ ; break;

         case :tmp = num ^ ; break;

         case :tmp = num ^ ; break;

         case :tmp = num ^ ; break;

         case :tmp = num ^ ; break;

         case :tmp = num ^ ; break;

         case :tmp = num ^ ; break;

         case :tmp = num ^ ; break;

     }

     return tmp;

 }

 Node bfs(int n){

     queue<Node> q;

     Node front;

     front.num = n;

     q.push(front);

     while(!q.empty()){

         front = q.front(); q.pop();

         for(int i = ; i < ; i++){

             Node tmp = front;

             tmp.num = click(i, front.num);

             tmp.path.push_back(i+);

             if(tmp.num == ) return tmp;

             else{

                 if(!visit[tmp.num]){

                     q.push(tmp);

                     visit[tmp.num] = ;

                 }

             }

         }

     }

 }

 int main(){

     int n;

     cin >> n;

     while(n--){

         string s;

         cin >> s;

         int num = ;

         for(int i = ; i < s.size(); i++){

             if(s[i] == 'b')num = *num + ;

             else if(s[i] == 'w') num = *num;

         }

         memset(visit, , sizeof(visit));

         visit[num] = ;

         Node tmp = bfs(num);

         for(int i = ; i < tmp.path.size(); i++){

             cout << tmp.path[i];

         }

         cout << endl;

     }

 }