Problem: You are given a positive number x. Find the smallest positive integer number that has the sum of digits equal to x and all digits are distinct (unique).

Input

The first line contains a single positive integer t (1 ≤ t ≤ 50) — the number of test cases in the test. Then t test cases follow.

Each test case consists of a single integer number x (1 ≤ x ≤ 50).

Output

Output t answers to the test cases:

  * if a positive integer number with the sum of digits equal to x and all digits are different exists, print the smallest such number; 
  * otherwise print -1. 

Example

Input


4
1
5
15
50


Output


1
5
69
-1

Solution (in JAVA):

Solution:
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.BigInteger;
 
public class CF {
    static int ret; 
    public static void helper(int n, int visited, int sum, int digit) {
        if (sum > n) return;
        if (sum == n) {
            ret = Math.min(ret, digit); 
            return; 
        }

        for (int i = 1; i <= 9; i++) {
            if ((visited & (1 << i)) != 0) continue;
            visited |= (1 << i);
            helper(n, visited, sum + i, digit * 10 + i);
            visited &= ~(1 << i);
        }

    } 

    public static void main (String[] args) {
	Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        while (t-- > 0) {
            int n = sc.nextInt();
            ret = Integer.MAX_VALUE;
            helper(n, 0, 0, 0);
            System.out.println((ret == Integer.MAX_VALUE) ? -1 : ret);
        }
    }
}