mystery-9-1_13705
Solve the mystery.
Input:
First line contains a single integer denoting number of test cases(T).
Next T lines have one test case per line.
Each test case is a string of alphabets [a-z].

Output:
Print answer to each test case in an individual line.

Constraints:
1 ≤ T ≤ 100
1 ≤ |S| ≤ 100
a ≤ S[i] ≤ z

Problem Setter : Siddharth Seth

SAMPLE INPUT
5
malayalam
ariyama
alla
brook
kurruk

SAMPLE OUTPUT
121
-1
108
-1
114
t = int(raw_input())
while(t>0):
	t -= 1
	a = raw_input()
	if(a == a[::-1]):		
		print(ord(a[len(a)/2]))
	else:
		print(-1)