cypher
Source: hackerearth
Difficulty: UNKNOWN_DIFFICULTY

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


t = int(input())
if t<=10000 and t>=1:
	lists = []
	for i in range(0,t):
		lists.append(input())
		
	for i in lists:
		j = 0;
		s = ''
		for letter in i:
			k = ord(letter) + j
			j += 1
			if k>122:
				s += chr(k-26)
			else:
				s += chr(k)
		print(s)
			
		


t=int(input())
while t:
	a=input()
	b=a[0]
	for x in range(1,len(a)):
		if (ord(a[x])+x) > 122:
			b=b+chr(ord(a[x])+x-26)
		else:
			b=b+chr(ord(a[x])+x)
	print(b)
	t=t-1
	


from sys import stdin
t=int(stdin.readline())
for j in range(0,t):
	a=stdin.readline()
	b=list(a)
	if (j!=(t-1)):
		b.pop()
	for i in range(0,len(b)):
		c=ord(a[i])+i
		while(c>122):
			d=c-122
			c=96+d
		b[i]=chr(c)
	a=''.join(b)
	print(a)


a=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
for _ in range(eval(input())):
	b=input()
	count=0
	c=[]
	for key in b:
		c.append(a[(int((a.index(key))+count)%26)])
		count+=1
	print(''.join(c))


import sys
for t in range(eval(input())):
	s=input()
	i=1
	l=len(s)
	sys.stdout.write(s[0])
	while i<l:
		n=ord(s[i])
		n=n+i
		while n>122:
			n=n-26
		sys.stdout.write(chr(n))
		i=i+1
	print()     
			


t=eval(input())
if t>=1 and t<=10000:
	for i in range(0,t):
		s=input()
		if len(s)>=1 and len(s)<=100:
			wd=""
			for i in range(0,len(s)):
				if ord(s[i])+i>122:
					wd=wd+chr(ord(s[i])+i-122+96)
				else:  
					wd=wd+chr(ord(s[i])+i)
			print(wd)
				


# DEVAJIT ASEM
# CYPHER

def decipher(s):
	text=[]
	for i in range(len(s)):
		if ord(s[i]) + i > 122:
			text.append(chr(ord(s[i])+i - 26))
		else:
			text.append(chr(i+ord(s[i])))
	return text
		
t = int(input())
 
for i in range(t):
	s = input()
	print("".join(decipher(s)))
	



#!/usr/bin/python

count = int(input())
for i in range(count):
	s = input()
	result = ""
	for index in range(len(s)):
		code = ord(s[index])+index
		if code > 122:
			result += chr(code-26)
		else:
			result += chr(code)
	print(result)



"""
A single integer T denoting number of cases. T lines follow a string S,consisting of only lowercase latin characters ( 'a' - 'z').
"""
def decipher(ch, step):
	"""
	moves ch back step times
	"""
	pos = ord(ch)
	
	if pos + step <= 122:
		pos = pos + step
	else:
		x = ord('z') - ord(ch)
		pos = ord('a') + step - x - 1
	return chr(pos)

T = int(input())

while (T != 0):
	
	S = input()
	step = 0
	answer = ""
	for letter in S:
		answer += decipher(letter, step)
		step += 1
	print(answer)
	T -= 1



def cypher(s):
	out=''
	for c in range(len(s)):
		o=ord(s[c])
		if o+c<=122:
			c=chr(o+c)
		else:
			x=abs((o+c)-122)
			c=chr(96+x)
		out+=c
	print(out)
if __name__ == "__main__":
	t=int(input())
	if t>=1 and t<=10000:
		while t>0:
			s=input()
			if len(s)>=1 and len(s)<=100:
				cypher(s)
			t-=1


tests = int(input())
for test in range(tests) :
	strings = input().split()
	for string in strings :
		c = 0
		word = []
		for letter in string :
			if ord(letter) + c > 122 :
				word.append(chr(97 +(c - (123 - ord(letter)))))
			else :
				word.append(chr(ord(letter)+c))
			c += 1
		print(''.join(word))


# DEVAJIT ASEM
# CYPHER

def decipher(s):
	text=""
	for i in range(len(s)):
		if ord(s[i]) + i > 122:
			text+=(chr(ord(s[i])+i - 26))
		else:
			text+=(chr(i+ord(s[i])))
	return text
		
t = int(input())
 
for i in range(t):
	s = input()
	print(decipher(s))
	



'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
#print 'Hello World!'
import sys

n = int(input())
i = 0

while (i < n):
	tc = input()
	ii = 0
	
	while (ii < len(tc)):
		if (ord(tc[ii]) + ii > 122):
			sys.stdout.write(chr((ord(tc[ii]) + ii) % 122 + 96))
		else:
			sys.stdout.write(chr(ord(tc[ii]) + ii))
		
		ii += 1
		
	print("")
	i += 1


noOfCases = int(input())

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

	for index in range(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 range(noOfCases):
	print(dicipher(input()))

# print shift_lower_case_letter("z",+3)


for i in range(eval(input())):
	p = input()
	shift = len(p)
	str1 = ""
	for i in range(0,shift):
		if p[i].isalpha():
		   k = ord(p[i]) + i
		   if k  > ord('z'):
			   k  -= 26
		   finalLetter  = chr(k)
		   str1 +=finalLetter
	print(str1)


T = eval(input())

while(T):
	T -= 1
	s = input()
	j = ""
	for i in range(len(s)):
		#j += chr(ord(s[i])+i)
		j += (chr((ord(s[i]) - 97 + i) % 26 + 97))
				
	print(j)


import sys
t=int(eval(input()))

alpha='abcdefghijklmnopqrstuvwxyz'
while t :
	s=input()
	n=len(s)
	for step in range(n) :
		sys.stdout.write(alpha[(ord(s[step])-ord('a')+step)%26])
	print()
	t-=1