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

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T,K;

int ret[1<<20];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	FOR(i,1<<20) ret[i]=1<<20;
	for(i=1;i<100000;i++) {
		string s=to_string(i);
		reverse(ALL(s));
		for(j=2;j<s.size();j++) if(s[j-2]-'0'+s[j-1]-'0'>=s[j]-'0') break;
		int sum=0;
		FORR(c,s) sum+=c-'0';
		if(j==s.size()) ret[sum]=min(ret[sum],i);
	}
	
	cin>>T;
	while(T--) {
		cin>>K;
		if(ret[K]>=1<<20) cout<<-1<<endl;
		else cout<<ret[K]<<endl;
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}