dalao求调
#include<bits/stdc++.h>
using namespace std;
int t;
int jilu;
int a[100005];
int ans;
int step;
vector<int>uu[8];
int main(){
uu[2].push_back(1);uu[3].push_back(7);uu[4].push_back(4);uu[5].push_back(2);uu[6].push_back(0);uu[7].push_back(8);
scanf("%d",&t);
while(t--){
scanf("%d",&jilu);
ans=0;
for(int i=7;i>=2;i--){if(jilu-i<0)continue;jilu-=i;a[++ans]=uu[i][0];}
if(jilu>0)cout<<-1<<endl;
else{step=ans;if(a[ans]==0){cout<<6;step--;}for(int i=step;i>=1;i--)cout<<a[i];cout<<endl;}}
return 0;
}