#include <algorithm>
#include <atcoder/segtree>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

bool is_super_fib(ll X){
    string sx = to_string(X);
    ll len = sx.size();
    bool pos = false;
    for (ll i = 0; i < len - 2; i++){
        ll v1 = (ll)(sx[i] - '0');
        ll v2 = (ll)(sx[i + 1] - '0');
        ll v3 = (ll)(sx[i + 2] - '0');
        if (v1 > v2 + v3){
            pos = true;
        }
    }
    return pos;
}

ll keta_sum(ll X){
    ll ret = 0;
    string sx = to_string(X);
    for (ll i = 0; i < sx.size(); i++){
        ret += (ll)(sx[i] - '0');
    }
    return ret;
}

int main() {
    // 実験で規則性を見つけたい
    // 小さいケースは埋め込んだほうが早そう
    vector<ll> nums(101);
    for (ll i = 10000000; i >= 100; i--){
        if (is_super_fib(i)){
            nums[keta_sum(i)] = i;
        }
    }
    /*rep(i, 61){
        debug_out(i, nums[i]);
    }*/
    ll T;
    cin >> T;
    while (T--){
        ll K;
        cin >> K;
        if (K <= 40){
            cout << nums[K] << endl;
        }
        else{
            if (K % 9 == 8){
                cout << "908";
                for (ll i = 0; i < (K - 8) / 9 - 1; i++){
                    cout << '9';
                }
                cout << endl;
            }
            else{
                ll div = K / 9;
                ll rem = K % 9;
                cout << rem + 1;
                cout << "908";
                for (ll i = 0; i < div - 2; i++){
                    cout << '9';
                }
                cout << endl;
            }
        }
    }
}