思1：我觉得有点像dp，然后用记忆化搜索，试图从已知huafein的最优秀的情况往后推，大概是可以做的 思2：bfs

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+9;
const int M = 1e5+0;
int T,val[100]={6,2,5,5,4,5,6,3,7,6},dis[100]={0,0,1,2,4,6,7,8};
//0 1 2 4 6 7 8
//6 2 5 4 6 3 7
int vis[N],ask[N],tot,ia[N];string ans[N];
int read()
{
	int x=0,f=1;char c=getchar();
	while(  c<'0'||c>'9' ){if(c=='-')f=-1;c=getchar();}
	while(!(c<'0'||c>'9')){x=(x<<3)+(x<<1)+c-48;c=getchar();}
	return x*f;
}
struct Node
{
	string s;int n;
	friend bool operator < (const Node &a,const Node &b)
	{
		if(a.s.length()>b.s.length())return a.s.length()>b.s.length();
		else if(a.s.length()<b.s.length())return a.s.length()>b.s.length();
		else return a.s>b.s;
	}
};
priority_queue<Node>q;
void solve()
{
	Node now;
	for(int i=2;i<=7;++i)
	{
		char c=(char)(48+dis[i]);
		now.s="";now.s+=c;now.n=val[dis[i]];
		vis[now.n]=1;if(ia[now.n]){ans[now.n]=now.s;}
		q.push(now);
	}
	while(!q.empty())
	{
		now=q.top();q.pop();
		//cout<<q.top().s<<endl;
		for(int i=1;i<=7;++i)
		{
			if(i==5)continue;
			char c=(char)(48+dis[i]);
			Node next;next.s=now.s+c,next.n=now.n+val[dis[i]];
			if(vis[next.n])continue;
			if(next.n>M)continue;
			if(ia[next.n]){ans[next.n]=next.s;}
			vis[next.n]=1;
			q.push(next);
		}
	}
}
int main()
{
	
	T=read();
	while(T--){ask[++tot]=read();ia[ask[tot]]=1;}solve();
	for(int i=1;i<=tot;++i)
	{
		if(!vis[ask[i]])cout<<-1<<endl;
		else cout<<ans[ask[i]]<<endl;
	}
	//vis[n]?cout<<ans[n]<<endl:cout<<"-1"<<endl;
	return 0;
}
/*
1
14

5
1
2
3
6
18
*/