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