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:
ta = int(raw_input())
for _ in range(ta):
    n = int(raw_input())
    if(n%3==0):
        cnt="5"
        while(n!=1):
            cnt+= "5"
            n-=1
        print cnt
        continue
    elif(n%5==0):
        cnt="3"
        while(n!=1):
            cnt += "3"
            n-=1
        print cnt
        continue
    elif(n==1 or n==2 or n==4):
        print -1
        continue
    temp = 0
    while(n!=5):
        n-=3
        temp+=3
    cnt="5"
    while(temp!=1):
        cnt +="5"
        
        temp-=1
    while(n!=0):
        cnt+="3"
        n-=1
    print cnt