#include<bits/stdc++.h>
using namespace std;
#define int long long
unordered_map<int,int>dp;
int c = 0,tot = 0;
vector<int>p,pp;
inline void dfs(int x){
	if(!x)return;
	int pos = upper_bound(p.begin(),p.end(),x)-p.begin()-1;
	for(int i = 0;i<pos+1;i++)cout<<c;tot+=pos+1;c^=1;dfs(x-p[pos]);
}
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	for(int i = 1;i<=100000;i++)p.push_back(i*(i-1));
	for(int i = 1;i<=100000;i++)pp.push_back(i*(i-1)/2);
	int t;cin>>t;while(t--){
		int n;cin>>n;
		int p = lower_bound(pp.begin(),pp.end(),n)-pp.begin();
		int s = 2*(pp[p]-n);tot = 0;
		dfs(s);assert(tot<=p+1);
		while(tot!=p+1)tot++,cout<<c,c^=1;cout<<endl;
	}
	
}