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:
for _ in range(int(raw_input())):
    c=0
    n=int(raw_input())
    temp=n
    if n<3:
        print(-1),
    elif n%15==0 or n%3==0:
        sum=0
        for j in range(n):
            sum=sum*10+5
        print(sum),
    elif n%5==0:
    	sum=0
        for j in range(n):
            sum=sum*10+3
        print(sum),
    
    else:
        
        while n>5:
            n-=5
            sum=0
            if n%3==0 and (temp-n)%5==0:
                for o in range(n):
                    sum=sum*10+5
                for o in range(temp-n):
                    sum=sum*10+3
                print sum,
                break
        else:
            print(-1),
    print;