#include<bits/stdc++.h>
#define PB emplace_back
#define MP make_pair
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int N = 500002, mod = 998244353;
template<typename T>
void read(T &x){
    int ch = getchar(); x = 0; bool f = false;
    for(;ch < '0' || ch > '9';ch = getchar());
    for(;ch >= '0' && ch <= '9';ch = getchar()) x = x * 10 + ch - '0';
    if(f) x = -x;
}
template<typename T>
bool chmax(T &a, const T &b){if(a < b) return a = b, 1; return 0;}
template<typename T>
bool chmin(T &a, const T &b){if(a > b) return a = b, 1; return 0;}
void qmo(int &x){x += x >> 31 & mod;}
int ksm(int a, int b){
    int res = 1;
    for(;b;b >>= 1, a = (LL)a * a % mod)
        if(b & 1) res = (LL)res * a % mod;
    return res;
}
int t, cnt[2][N<<1], n; char str[N];
void solve(){
	scanf("%s", str+1); n = strlen(str+1);
	for(int i = 1, x = N;i <= n;++ i){
		++cnt[str[i]-'0'][x];
		x += 2*(str[i]-'0')-1;
	}
	for(int i = 1, x = N;i <= n;++ i){
		if(cnt[0][x] && cnt[1][x-1]){putchar('0'); --cnt[0][x]; --x;}
		else if(cnt[1][x]){putchar('1'); --cnt[1][x]; ++x;}
		else {putchar('0'); --cnt[0][x]; --x;}
	} putchar('\n');
}
int main(){read(t); while(t --) solve();}