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

#define rep(i, a, b) for (int i = a; i < b; i++)
using ll = long long;

int main(){
	int t;
	cin >> t;
    int n = 1;
    rep(i, 0, 6) n *= 10;
    map<int, int> mp;
    rep(val, 0, n) {
        string s = to_string(val);
        int sz = s.size();
        int f = 0;
        rep(i, 0, sz - 2) {
            if (s[i] - '0' <= s[i + 1] - '0' + s[i + 2] - '0') {
                f = 1;
                break;
            }
        }
        if (f == 0) {
            int sum = 0;
            rep(i, 0, sz) sum += s[i] - '0';
            if(mp.find(sum) == mp.end()) {
                mp[sum] = val;
            }
        }
    }
    rep(i, 0, t) {
        int k;
        cin >> k;
        if(mp.find(k) == mp.end()) {
            cout << -1 << endl;
        } else {
            cout << mp[k] << endl;
        }
    }
}