#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <list>
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <map>
#include <algorithm>
using namespace std;

#define rep(i,n) for(int i=0; i<n; i++)
#define forr(i,a,b) for (int i=a; i<=b; i++)
#define ford(i,a,b) for (int i=a; i>=b; i--)
#define mset(a,b) memset(a,b,sizeof(a))
#define sz size()
#define all(A) A.begin(),A.end()
#define sqr(q) q*q
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define X first
#define Y second

typedef long long i64;
typedef vector<int> VI;
typedef vector< VI > VVI;
typedef pair<int,int> PII;
typedef vector<string> VS;


int main()
{

        int g[140];
        g[1]=1;
        g[0]=0;
        forr(i,2,100)
                g[i]=g[i-1]+g[i-2]+1;

        int tc;
        scanf("%d",&tc);
        int ans[120];
        while (tc--)
        {
                int n;
                scanf("%d",&n);
                mset(ans,0);

                while (n)
                {
                        int j=0;
                        while (g[j]<n) j++;
                        ans[j]=1;
                        n-=g[j-1]+1;
                }
                int t=100;
                while (!ans[t]) t--;
                ford(i,t,1) printf("%d",ans[i]);
                printf("\n");
        }


        return 0;
}