Problem: Raju is very fond of strings.Once he was playing a  game with his friend.His friend gave him a string to decipher.As Raju is not very good at programming, he ask for your help.

So he provide you a string and your task is  to decipher it.

Note : The pattern is hidden in the Sample Test Cases.

INPUT
A single integer T denoting number of cases.
T lines follow a string S,consisting of only lowercase latin characters ( 'a' - 'z').

OUTPUT
Print the output in a new line  for every test cases.

Constraints

1 ≤ T ≤ 10000
1 ≤ |s| ≤ 100

*Problem Setter : *Shikhar Singh

SAMPLE INPUT
10
tdaejjptlzec
qvcopt
aacpax
cqwmpzr
gdlbnj
qzxjgjj
azzyyx
cnbb
wxqfsta
wgwmdt

SAMPLE OUTPUT
technovation
qwerty
abesec
cryptex
genero
qazmkop
aabbcc
code
wysiwyg
whyphy

Solution (in PYTHON):

Solution:
noOfCases = int(raw_input())

def dicipher(ciphered_text):
	# print ciphered_text
	# print "input -----> " + ciphered_text
	diciphered_text = ciphered_text[0]
	noOfShifts = 1

	for index in xrange(1,len(ciphered_text)):
		diciphered_text += shift_lower_case_letter(ciphered_text[index],noOfShifts)
		noOfShifts += 1
	return diciphered_text

def shift_lower_case_letter(letter, noOfShifts):
	ordinality_of_letter = ord(letter)
	if ordinality_of_letter >= 97 or ordinality_of_letter <= 122:
		shifted_result_ord = ordinality_of_letter + noOfShifts

		if shifted_result_ord < 97:
			shifted_result_ord += 26 

		elif shifted_result_ord > 122:
			shifted_result_ord -= 26 

		return chr(shifted_result_ord)
	return letter

for i in xrange(noOfCases):
	print dicipher(raw_input())

# print shift_lower_case_letter("z",+3)