#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    auto f = [&](ll v){
        string s = to_string(v);
        int n = s.size();
        vector<vector<vector<vector<ll>>>> dp(n + 1, 
        vector<vector<vector<ll>>>(2, 
        vector<vector<ll>>(11,
        vector<ll>(11))));
        dp[0][1][10][10] = 1;
        for(int i = 0; i < n; i++){
            for(int j = 0; j < 2; j++){
                int r = j ? s[i] - '0' : 9;
                for(int k = 0; k < 10; k++){
                    for(int l = 0; l < 10; l++){
                        for(int m = 0; m <= r; m++){
                            if(l > k && k < m && m != l) dp[i + 1][j & (m == r)][m][k] += dp[i][j][k][l];
                            if(l < k && k > m && m != l) dp[i + 1][j & (m == r)][m][k] += dp[i][j][k][l];
                        }
                    }
                    for(int m = 0; m <= r; m++){
                        if(m != k) dp[i + 1][j & (m == r)][m][k] += dp[i][j][k][10];
                    }
                }
                for(int m = 0; m <= r; m++){
                    if(m == 0){
                        dp[i + 1][j & (m == r)][10][10] += dp[i][j][10][10];
                    }else{
                        dp[i + 1][j & (m == r)][m][10] += dp[i][j][10][10];
                    }
                }
            }
        }
        ll ans = -82;
        for(int i = 0; i < 10; i++){
            for(int j = 0; j < 10; j++){
                ans += dp[n][0][i][j] + dp[n][1][i][j];
            }
        }
        return ans;
    };
    while(T--){
        ll v, ng = 99, ok = 1'000'000'000'000'000'000, mid;
        cin >> v;
        v--;
        while(ng + 1 < ok){
            mid = (ok + ng) / 2;
            if(f(mid) >= v) ok = mid;
            else ng = mid;
        }
        cout << ok << '\n';
    }
}