Problem: Yes, you read it right - Little Jhool is back, but no, he's not over his break up, still. And he's sad, broken and depressed; thus, he decided to visit a psychologist. She tells him to think about his pleasant memories of childhood, and stay busy so as to not miss his ex-girlfriend.

She asks him about his favorite memories from childhood, and being the genius Mathematician Little Jhool is, he remembered that solving Mathematics problem given to him by his teacher was his favorite memory.

He had two types of notebooks, when he was a kid.
10 problems could be solved in one page, in the first notebook.
12 problems could be solved in one page, in the second notebook.

Little Jhool remembered how in order to maintain symmetry, if he was given with n problems in total to solve, he tore out pages from both notebooks, so no space was wasted. EVER!

But, now he's unable to solve his own problem because of his depression, and for the exercise of the week, he has to answer the queries asked by his psychologist.

Given n number of questions, print the minimum number of pages he needs to tear out from the combination of both the notebooks, so that no space is wasted.

Input Format:
The first line will contain t - number of test cases.

The second will contain an integer n - number of questions.

Output Format:
Corresponding to the input, print the minimum number of pages Little Jhool needs to tear out from the combination of both the notebooks. If it is NOT possible, print  "-1".

Constraints:  
1 ≤ t  ≤ 100  
1 ≤ n ≤ 113 

SAMPLE INPUT
2
23
32

SAMPLE OUTPUT
-1
3

Explanation

For 32: 2 pages from the notebook, where 10 can be solved; 1 page from the notebook, where 12 can be solved.

Solution (in PYTHON):

Solution:
#http://www.hackerearth.com/problem/algorithm/studious-little-jhool/
import fileinput


def findMinPages (n):
    if n%2 == 1:
        minp = -1
        return minp

    if n==10:
        minp = 1
        return minp

    if n<12:
        minp = -1
        return minp
    
    hq = n / 12
    hr = n % 12
    
    i = hq
    j = 1
    
    if hr == 0:
        minp = hq
    else:
        while ( ((i*12) + (j*10) != n) ):
            i -= 1 
            j += 1 
#        print i , j
        if i<0:
            minp = -1
        else:
            minp = i + j
    return minp

#for i in xrange (200):
#    print i, findMinPages(i)


finput=fileinput.input()

for line in fileinput.input():
    if not fileinput.isfirstline():
        ip = line.split(' ')
        print findMinPages(int(ip[0]))