//2024.10.31 ljl luogu P11229 [CSP-J 2024] 小木棍（民间数据）
#include <bits/stdc++.h>
using namespace std;
int t, n, sum;

int main() {
	cin >> t;
	while (t--) {
		cin >> n;
		sum = n / 7;
		if (n == 1) {
			cout << -1;
		} else if (sum == 0) {
			if (n % 7 == 2)
				cout << 1;
			else if (n % 7 == 3)
				cout << 7;
			else if (n % 7 == 4)
				cout << 4;
			else if (n % 7 == 5)
				cout << 2;
			else if (n % 7 == 6)
				cout << 6;

		} else if (n % 7 == 0) {
			for (int i = 1; i <= sum; i++)
				cout << 8;
		} else {
			for (int i = 1; i <= sum + 1; i++) {
				if (n % 7 == 2)
					n -= 2, cout << 1;
				else if (n % 7 > 2 && n % 7 <= 5)
					n -= 5, cout << 2;
				else if (n % 7 == 6 && i == 1)
					n -= 6, cout << 6;
				else if (n % 7 == 6 && i != 1)
					n -= 6, cout << 0;
				else if (n % 7 == 0)
					cout << 8;
			}
		}
		cout << endl;
	}
	return 0;
}