#define u uint64_t

vector<vector<u>> dp(285113, vector<u>(20, -1));
vector<u> prefixSum(285113, 0);

u recur(u num, u bits){
    if(dp[num][bits] != -1)
        return dp[num][bits];
    
    if(bits == 1) 
        return dp[num][bits] = ((num < 10) ? 1 : 0);
    
    u val = 0, ans = 0, powerOfTwo = pow(2, bits-1);
    for(int i = 0; i < 10; ++i){
        if(num < val)  break;
        ans += recur(num - val, bits-1);
        val += powerOfTwo;
    }
    return dp[num][bits] = ans;
}

const int iife = []{
    dp[0][1] = 1;
    dp[1][1] = 1;
    prefixSum[0] = 1;
    prefixSum[1] = 2;
    u nextPowerOfTwo = 2, bits = 1;
    u i = 2;
    for(; i < 285113; ++i){
        if(i == nextPowerOfTwo){
            nextPowerOfTwo *= 2;
            ++bits;
        }
        prefixSum[i] = prefixSum[i-1] + recur(i, bits);
    }
    return 1;
}();

void func(long &count, long num, long bits, long nth, vector<long> &res){
    if(dp[num][bits] >= 0 && count + dp[num][bits] < nth){
        count += dp[num][bits];
        return;
    }
    
    if(bits == 1){
        if(num < 10){    
            ++count;
            res[bits-1] = num;
        }
        return;
    }
    
    long powerOfTwo = pow(2, bits - 1), val = 0, i = 0;
    while(count != nth && val <= num){
        res[bits-1] = i;
        func(count, num-val, bits-1, nth, res);
        val += powerOfTwo;
        ++i;
    }
    return;
}

long decibinaryNumbers(long x) {
    if(x == 1)  return 0;
    if(x == 2)  return 1;
    auto itr = lower_bound(prefixSum.begin(), prefixSum.end(), (u)(x));
    
    long decimalValue = itr - prefixSum.begin();
    long nth = x - prefixSum[decimalValue-1];
    long bits = log2(decimalValue) + 1;

    vector<long> res(bits, 0);
    long count = 0;
    
    func(count, decimalValue, bits, nth, res);
    
    long ans = 0;
    for(int i = res.size()-1; i >= 0; --i){
        ans = ans * 10 + res[i];
    }
    return ans;
}

op=[]
def generate_decibinary(n):
        l=[int(i) for i in list(str(n))]
        m=len(l)
        dp=[0 for i in range(m+1)]
        for i in range(m-1,-1,-1):
            dp[i]=dp[i+1]+l[i]*2**(m-i-1)
        op.append([n,dp[0]])


t=int(input())
ip=[]
for _ in range(t):
    n=int(input())
    ip.append(n)
for i in range(0,1000000):
    generate_decibinary(i)
op=sorted(op,key=lambda x:x[1])
for i in ip:
    print(op[i-1][0])