Problem: In vardhaman college of engineering, there is competition with name treasure lock.
To make this competition the key for the lock should satisfy following rules.
1 .3, 5, or both as its digits. No other digit is allowed.
2. Number of times 3 appears is divisible by 5.
3. Number of times 5 appears is divisible by 3.

Rakesh is very eager to win the championship. He is developing a code for that key.Assume yourself in that situation and solve for the key.

INPUT:
first line contains T testcases.
Next T lines consists of the number.
OUTPUT:
Output the number satisfying the above conditions.
if n cannot satisfy the above conditions print -1.

0<t<10
0<n<1000

SAMPLE INPUT
4
1
3
5
17

SAMPLE OUTPUT
-1
555
33333
55555555555533333

Solution (in PYTHON):

Solution:
test=int(input())
for i in range(test):
	num=int(raw_input())
	s=''
	th=0
	if num%3==0:s='5'*num
	elif num%5==0:s='3'*num
	else:
		while (num-th)>0:
			if (num-th)%5==0:
				s='5'*th+'3'*(num-th)
			th+=3	
	if s!='':print s
	else:print -1