#include <bits/stdc++.h>
#define fir first
#define sec second
#define PB push_back
#define MP make_pair

using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)

template <class T> void chkmax(T& x, T y) { x = (x > y ? x : y); }
template <class T> void chkmin(T& x, T y) { x = (x < y ? x : y); }

typedef long long LL;
typedef pair <int, int> pii;
typedef vector <int> vi;

const int N = 5e5 + 5;
const int base = 5e5 + 5;

int T, n, a[N];
string s;

int e[N * 2];

void getans(){
    int pos = base, cnt = 0;

    while (cnt < n){
        if (e[pos - 1] > 1){
            a[++cnt] = 0;
            e[pos - 1]--;
            pos--;
        } else if (e[pos]){
            a[++cnt] = 1;
            e[pos]--;
            pos++;
        } else {
            a[++cnt] = 0;
            e[pos - 1]--;
            pos--;
        }
    }
}

int main(){
    scanf("%d", &T);
    while (T--){
        cin >> s;
        n = s.size();
        a[0] = 0;
        rep(i, n) a[i + 1] = s[i] == '1' ? 1 : -1;
        rep1(i, n + 1) a[i] += a[i - 1];
        rep(i, n + 1) a[i] += base; 

        for (int i = base; i <= base + n + 1; ++i) e[i] = 0;
        for (int i = base; i >= base - n - 1; --i) e[i] = 0;

        rep(i, n) e[min(a[i], a[i + 1])]++;

        getans();

        rep1(i, n + 1) printf("%d", a[i]);
        printf("\n");

    }

    return 0;
}