#include <map>

#include <set>

#include <list>

#include <cmath>

#include <queue>

#include <stack>

#include <cstdio>

#include <vector>

#include <string>

#include <cctype>

#include <complex>

#include <cassert>

#include <utility>

#include <cstring>

#include <cstdlib>

#include <iostream>

#include <algorithm>

using namespace std;

typedef pair<int,int> PII;

typedef long long ll;

#define lson l,m,rt<<1

#define pi acos(-1.0)

#define rson m+1,r,rt<<11

#define All 1,N,1

#define read freopen("in.txt", "r", stdin)

const ll  INFll =0xfffffffffLL;

const int INF= 0x7ffffff;

const int mod =;

ll dp[][][][],n;

int bit[];

ll dfs(int i,int j,int k,int l,int e){

    if(i==)

    return l;

    if(!e&&dp[i][j][k][l]!=-)

        return dp[i][j][k][l];

    int u=e?bit[i]:;

    ll num=;

    for(int v=;v<=u;++v){

        if(l==)

        num+=dfs(i-,v==,j,,(e&&v==u));

        else

        num+=dfs(i-,v==,j,j&&k&&v==,(e&&v==u));

    }

    return e?num:dp[i][j][k][l]=num;

}

ll getnum(ll x){

    int len=;

    while(x){

        bit[++len]=x%;

        x/=;

    }

    return dfs(len,,,,);

}

int main()

{

    memset(dp,-,sizeof(dp));

    int t;

    scanf("%d",&t);

    ll n;

    while(t--){

        scanf("%I64d",&n);

       ll l=,r=INFll,mid;

        while(l<=r){

            mid=(l+r)>>;

            if(getnum(mid)<n)l=mid+;

            else r=mid-;

        }

        printf("%I64d\n",l);

    }

return ;

}