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 PYTHON):

Solution:
import sys

def solve():
    x = int(raw_input())
    if x>45:
        print(-1)
        return
    ans = sys.maxint
    for i in range(1, 2**10):
        sm = 0
        cand = 0
        for j in range(1, 10):
            if (1<<j)&i:
                cand*=10
                cand+=j
                sm+=j
        if sm == x:
            ans = min(ans, cand)
    print(ans)

t=int(raw_input())

for _ in range(t):
    solve()