Project Euler #41: Pandigital prime

_{This problem is a programming version of Problem 41 from projecteuler.net}

We shall say that an -digit number is pandigital if it makes use of all the digits 1 to exactly once. For example, is a -digit pandigital and is also prime.

What is the largest -digit pandigital prime ? If there is none, print -1

Input Format

First line contains that denotes the number of test cases. This is followed by lines, each containing an integer, .

Constraints

Output Format

Print the required answer for each test case.

Sample Input

2
100
10000

Sample Output

-1
4231