#include <bits/stdc++.h>
using namespace std;
int cost[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int t, n;
const int Max = 1e5/7+5;
int a[Max];
bool flag;
void dfs(int num, int step)
{
	if(flag)return ;
	if(num == n&&step == n/7+2)
	{
		for(int i = 1;i <= n/7+1;i++)
			cout << a[i];
		flag = 1;
	}
	if(step > n/7+2)return ;
	if(num > n||n-num == 1)return ;
	if(step != 1)
	{
		for(int i = 0;i <= 9;i++)
		{
			a[step] = i;
			dfs(num+cost[i], step+1);
		}
	}
	else
	{
		for(int i = 1;i <= 9;i++)
		{
			a[step] = i;
			dfs(num+cost[i], step+1);
		}
	}
}
int main()
{
	ios::sync_with_stdio(0);
	cin >> t;
	while(t--)
	{
		flag = 0;
		memset(a, 0, sizeof(a));
		cin >> n;
		int left = n-n/7*7;
		if(n%7 == 0)
		{
			for(int i = 1;i <= n/7;i++)
				cout << 8;
			cout << "\n";
			continue;
		}
		if(n == 1)
		{
			cout << "-1\n";
			continue;
		}
		if(left == 2)
		{
			cout << 1;
			for(int i = 1;i <= n/7;i++)
				cout << 8;
			cout << "\n";
			continue;
		}
		int save = n/7;
		n = left+(n <= 7?0:7);
		dfs(0, 1);
		for(int i = 1;i <= save-1;i++)
			cout << 8;
		cout << "\n";
	}
	return 0;
}

要求：不允许打表 只能在原先的程序上修改