Chef recently graduated Computer Science in university, so he was looking for a job. He applied for several job offers, but he eventually settled for a software engineering job at ShareChat. Chef was very enthusiastic about his new job and the first mission assigned to him was to implement a message encoding feature to ensure the chat is private and secure.
Chef has a message, which is a string $S$ with length $N$ containing only lowercase English letters. It should be encoded in two steps as follows: 
- Swap the first and second character of the string $S$, then swap the 3rd and 4th character, then the 5th and 6th character and so on. If the length of $S$ is odd, the last character should not be swapped with any other.
- Replace each occurrence of the letter 'a' in the message obtained after the first step by the letter 'z', each occurrence of 'b' by 'y', each occurrence of 'c' by 'x', etc, and each occurrence of 'z' in the message obtained after the first step by 'a'.
The string produced in the second step is the encoded message. Help Chef and find this message.

-----Input-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- The first line of each test case contains a single integer $N$.
- The second line contains the message string $S$.

-----Output-----
For each test case, print a single line containing one string — the encoded message.

-----Constraints-----
- $1 \le T \le 1,000$
- $1 \le N \le 100$
- $|S| = N$
- $S$ contains only lowercase English letters

-----Example Input-----
2
9
sharechat
4
chef

-----Example Output-----
shizxvzsg
sxuv

-----Explanation-----
Example case 1: The original message is "sharechat". In the first step, we swap four pairs of letters (note that the last letter is not swapped), so it becomes "hsraceaht". In the second step, we replace the first letter ('h') by 's', the second letter ('s') by 'h', and so on, so the resulting encoded message is "shizxvzsg".

Difficulty: EASY
Tags: Implementation

Starter code:

Solutions:
for tc in range(int(input())):
	n = int(input())
	s = input()
	s = list(s)
	for i in range(1, len(s), 2):
		(s[i], s[i - 1]) = (s[i - 1], s[i])
	for i in range(len(s)):
		m = ord(s[i])
		n = ord('a')
		x = m - n
		y = n + 25 - x
		y = chr(y)
		s[i] = y
	print(''.join(s))


def cipher(a):
	l = 'abcdefghijklmnopqrstuvwxyz'
	s = l[-l.index(a) - 1]
	return s
for t in range(int(input())):
	n = int(input())
	s = list(input())
	if n % 2 == 0:
		for i in range(0, n, 2):
			(s[i], s[i + 1]) = (s[i + 1], s[i])
	else:
		for i in range(0, n - 1, 2):
			(s[i], s[i + 1]) = (s[i + 1], s[i])
	snew = [cipher(x) for x in s]
	print(''.join(snew))


for i in range(int(input())):
	n = int(input())
	s = input()
	l = ['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']
	m = l[::-1]
	a = ''
	c = ''
	if n % 2 != 0:
		k = s[-1]
	for i in range(1, n, 2):
		a = a + s[i] + s[i - 1]
	if n % 2 != 0:
		a = a + k
	for i in a:
		b = l.index(i)
		c = c + m[b]
	print(c)


for _ in range(int(input())):
	n = int(input())
	s = input()
	lst = list(s)
	if n % 2 != 0:
		length = n - 1
	else:
		length = n
	for i in range(0, length, 2):
		(lst[i], lst[i + 1]) = (lst[i + 1], lst[i])
	alpha = 'abcdefghijklmnopqrstuvwxyz'
	for x in range(0, n):
		lst[x] = alpha[25 - alpha.index(lst[x])]
	string = ''.join(lst)
	print(string)


num = int(input())
for x in range(num):
	length = int(input())
	string = input()
	lst = list(string)
	if length % 2 != 0:
		lengthx = length - 1
	else:
		lengthx = length
	for y in range(0, lengthx, 2):
		temp = lst[y]
		lst[y] = lst[y + 1]
		lst[y + 1] = temp
	alphabet = 'abcdefghijklmnopqrstuvwxyz'
	for x in range(0, length):
		lst[x] = alphabet[25 - alphabet.index(lst[x])]
	string = ''.join(lst)
	print(string)


num = int(input())
for x in range(num):
	length = int(input())
	lst = list(input())
	for y in range(0, length - 1, 2):
		(lst[y], lst[y + 1]) = (lst[y + 1], lst[y])
	alphabet = 'abcdefghijklmnopqrstuvwxyz'
	for i in range(length):
		lst[i] = alphabet[25 - alphabet.index(lst[i])]
		print('', end='')
	for i in range(length):
		print(lst[i], end='')
		if i != length - 1:
			print('', end='')
	print('')


t = int(input())
for _ in range(t):
	length = int(input())
	word = input()
	alphabet_dict = {'a': 'z', 'b': 'y', 'c': 'x', 'd': 'w', 'e': 'v', 'f': 'u', 'g': 't', 'h': 's', 'i': 'r', 'j': 'q', 'k': 'p', 'l': 'o', 'm': 'n', 'n': 'm', 'o': 'l', 'p': 'k', 'q': 'j', 'r': 'i', 's': 'h', 't': 'g', 'u': 'f', 'v': 'e', 'w': 'd', 'x': 'c', 'y': 'b', 'z': 'a'}
	last_word = word[length - 1]
	string = ''
	if length % 2 == 1:
		for n in range(0, length - 1, 2):
			string += word[n + 1] + word[n]
		string += last_word
	else:
		for n in range(0, length, 2):
			string += word[n + 1] + word[n]
	main_string = ''
	for i in string:
		main_string += alphabet_dict[i]
	print(main_string)


for i in range(int(input())):
	n = int(input())
	s = input()
	b = ''
	a = ''
	if n % 2 == 0:
		for j in range(0, n, 2):
			b = b + s[j + 1]
			b = b + s[j]
	else:
		for j in range(0, n - 1, 2):
			b = b + s[j + 1]
			b = b + s[j]
		b = b + s[n - 1]
	for k in b:
		x = ord(k)
		y = x - 96
		a = a + chr(123 - y)
	print(a)


t = int(input())
for _ in range(t):
	n = int(input())
	s = input()
	l = list(s)
	for i in range(0, n - 1, 2):
		temp = l[i]
		l[i] = l[i + 1]
		l[i + 1] = temp
	for i in l:
		k = abs(97 - ord(i))
		d = 122 - k
		print(chr(d), end='')
	print()


t = int(input())
while t != 0:
	n = int(input())
	str1 = input()
	str2 = list(str1)
	l = 0
	lst = list()
	for i in range(1, n, 2):
		l = str2[i]
		str2[i] = str2[i - 1]
		str2[i - 1] = l
	listToStr = ''.join([str(elem) for elem in str2])
	ch = ''
	for i in range(len(listToStr)):
		ch = chr(ord('z') - ord(listToStr[i]) + ord('a'))
		print(ch, end='')
	print()
	t -= 1


t = int(input())
for _ in range(t):
	n = int(input())
	s = input()
	s = list(s)
	for i in range(0, n - 1, 2):
		(s[i], s[i + 1]) = (s[i + 1], s[i])
	for i in range(n):
		if s[i] != ' ':
			s[i] = chr(ord('a') + ord('z') - ord(s[i]))
	print(''.join(s))


T = int(input())
for p in range(T):
	n = int(input())
	s = input()
	l = list(s)
	for i in range(0, n - 1, 2):
		temp = l[i]
		l[i] = l[i + 1]
		l[i + 1] = temp
	for j in l:
		k = abs(97 - ord(j))
		d = 122 - k
		print(chr(d), end='')
	print()


t = int(input())
for i in range(t):
	n = int(input())
	s = input()
	a = 'abcdefghijklmnopqrstuvwxyz'
	l = list(s)
	m = list(a)
	if n % 2 != 0:
		for i in range(1, len(l) - 1, +2):
			t = l[i]
			l[i] = l[i - 1]
			l[i - 1] = t
	else:
		for i in range(1, len(l), +2):
			t = l[i]
			l[i] = l[i - 1]
			l[i - 1] = t
	for i in range(len(l)):
		for j in range(len(m)):
			if l[i] == m[j]:
				l[i] = m[25 - j]
				break
	s = ''
	for i in l:
		s = s + i
	print(s)


t = int(input())
for j in range(t):
	n = int(input())
	a = input()
	l = list(a)
	for i in range(0, n - 1, 2):
		temp = l[i]
		l[i] = l[i + 1]
		l[i + 1] = temp
	for i in l:
		b = abs(97 - ord(i))
		x = 122 - b
		print(chr(x), end='')
	print()


def generate():
	dic = {}
	i = 122
	for j in range(97, 123):
		dic[chr(j)] = chr(i)
		i -= 1
	return dic

def swap_characters(string):
	string = list(string)
	for i in range(0, len(string) - 1, 2):
		temp = string[i]
		string[i] = string[i + 1]
		string[i + 1] = temp
	return ''.join(string)

def invert(swap, letter):
	new_swap = ''
	for i in swap:
		new_swap += letter[i]
	return new_swap

def encode(string):
	letter = generate()
	swap = swap_characters(string)
	swap = invert(swap, letter)
	return swap
t = int(input())
for _ in range(t):
	n = int(input())
	string = str(input())
	print(encode(string))


n = int(input())
for _ in range(n):
	l = int(input())
	L1 = list(input())
	for i in range(0, len(L1) - 1, 2):
		(L1[i], L1[i + 1]) = (L1[i + 1], L1[i])
	st = ''.join(L1)
	alphabet = 'abcdefghijklmnopqrstuvwxyz'
	trans = str.maketrans(alphabet, alphabet[::-1], ' ')
	st = st.lower().translate(trans)
	print(st)


def generate():
	dic = {}
	j = 122
	for i in range(97, 123):
		dic[chr(i)] = chr(j)
		j -= 1
	return dic
letters = generate()

def encode(string):
	for i in range(0, len(string) - 1, 2):
		temp = string[i]
		string[i] = string[i + 1]
		string[i + 1] = temp
	new_string = ''
	letter = generate()
	for i in string:
		new_string += letter[i]
	return new_string
n = int(input())
for i in range(n):
	k = int(input())
	string = list(input())
	print(encode(string))


for _ in range(int(input())):
	n = int(input())
	s = input()
	lst = list(s)
	if n % 2 != 0:
		n1 = n - 1
	else:
		n1 = n
	for i in range(0, n1, 2):
		temp = lst[i]
		lst[i] = lst[i + 1]
		lst[i + 1] = temp
	alphabet = 'abcdefghijklmnopqrstuvwxyz'
	for j in range(0, n):
		lst[j] = alphabet[25 - alphabet.index(lst[j])]
	string = ''.join(lst)
	print(string)


for _ in range(int(input())):
	n = int(input())
	s = input()
	encL1 = ''
	n = len(s)
	if n % 2 != 0:
		n -= 1
	li = list(s)
	for i in range(n):
		if i % 2 == 0:
			tem = li[i]
			li[i] = li[i + 1]
			li[i + 1] = tem
	for (index, i) in enumerate(li):
		if ord(i) <= 109 and ord(i) >= 97:
			li[index] = chr(122 - (ord(i) - 97))
		elif ord(i) <= 122 and ord(i) >= 110:
			li[index] = chr(97 + (122 - ord(i)))
	for i in li:
		encL1 += i
	print(encL1)


for _ in range(int(input())):
	n = int(input())
	S = list(input())
	ors = 'abcdefghijklmnopqrstuvwxyz'
	for i in range(0, n, 2):
		if i + 1 in range(n):
			temp = S[i]
			S[i] = S[i + 1]
			S[i + 1] = temp
	for i in range(n):
		S[i] = ors[25 - ors.find(S[i])]
	print(''.join(S))


t = int(input())

def getC(c):
	x = 96 + (97 - ord(c) + 26)
	return chr(x)
for i in range(t):
	N = int(input())
	S = str(input())
	ans = ''
	flag = True
	for (j, c) in enumerate(S):
		if flag and j + 1 < N:
			ans += getC(S[j + 1])
			flag = False
		elif not flag:
			ans += getC(S[j - 1])
			flag = True
		else:
			ans += getC(S[j])
	print(ans)


for _ in range(int(input())):
	n = int(input())
	s = input()
	l = []
	k = len(s)
	if k % 2 == 0:
		t = k
	else:
		t = k - 1
	for i in range(0, t, 2):
		l.append(chr(ord('z') - ord(s[i + 1]) + ord('a')))
		l.append(chr(ord('z') - ord(s[i]) + ord('a')))
	if k % 2 != 0:
		l.append(chr(ord('z') - ord(s[k - 1]) + ord('a')))
	print(''.join(l))


alphabet = 'abcdefghijklmnopqrstuvwxyz'
alphabet = list(alphabet)
alphabet_terbalik = alphabet[::-1]
cases = int(input())
for case in range(cases):
	length = int(input())
	string = list(str(input()))
	n = 0
	for n in range(0, length - 1, 2):
		(string[n], string[n + 1]) = (string[n + 1], string[n])
	i = 0
	while i < length:
		j = 0
		while j < len(alphabet):
			if alphabet[j] == string[i]:
				string[i] = alphabet_terbalik[j]
				break
			j += 1
		i += 1
	print(''.join(string))


def convert(c):
	return chr(122 - (ord(c) - 97))
tests = int(input())
for i in range(tests):
	length = int(input())
	string = input()
	st = ''
	for i in range(0, length, 2):
		if i + 1 != length:
			st += convert(string[i + 1])
			st += convert(string[i])
		else:
			st += convert(string[i])
	print(st)


val = int(input())
for i in range(val):
	n = int(input())
	p = list(input())
	for j in range(0, n, 2):
		p[j] = chr(122 - (ord(p[j]) - 97))
		if j % 2 == 0 and j + 1 < n:
			p[j + 1] = chr(122 - (ord(p[j + 1]) - 97))
			(p[j], p[j + 1]) = (p[j + 1], p[j])
	print(''.join(p))


for i in range(int(input())):
	a = int(input())
	s = input()
	l = list(s)
	p = 'abcdefghijklmnopqrstuvwxyz'
	l1 = 0
	if a % 2 != 0:
		l1 = a - 1
	else:
		l1 = a
	for i in range(0, l1, 2):
		(l[i], l[i + 1]) = (l[i + 1], l[i])
	for j in range(a):
		l[j] = p[25 - p.index(l[j])]
	s = ''.join(l)
	print(s)


t = int(input())
for i in range(t):
	n = int(input())
	a = input()
	s = list(a)
	for i in range(0, n - 1, 2):
		(s[i], s[i + 1]) = (s[i + 1], s[i])
	for i in range(n):
		if ord(s[i]) <= 109 and ord(s[i]) >= 97:
			j = 2 * (ord(s[i]) - 97)
			s[i] = chr(ord(s[i]) + (25 - j))
		elif ord(s[i]) >= 110 and ord(s[i]) <= 122:
			j = 2 * (122 - ord(s[i]))
			s[i] = chr(ord(s[i]) - (25 - j))
	s = ''.join(s)
	print(s)


import string
l = list(string.ascii_lowercase)
l1 = l[::-1]
d = dict()
for j in range(len(l)):
	d[l[j]] = l1[j]
for _ in range(int(input())):
	n = int(input())
	s = list(input())
	for i in range(0, len(s), 2):
		if i == len(s) - 1:
			continue
		else:
			(s[i], s[i + 1]) = (s[i + 1], s[i])
	for j in range(len(s)):
		s[j] = d[s[j]]
	print(''.join(s))


import string
t = int(input())
for i in range(t):
	n = int(input())
	s = input()
	e = ''
	if n % 2 == 0:
		for i in range(0, n, 2):
			e += s[i + 1] + s[i]
	else:
		for i in range(0, n - 1, 2):
			e += s[i + 1] + s[i]
		e += s[-1]
	en = ''
	for i in e:
		x = string.ascii_lowercase
		a = x.index(i)
		en += x[len(x) - a - 1]
	print(en)


t = int(input())
for i in range(t):
	n = int(input())
	s = str(input())
	lt = 'abcdefghijklmnopqrstuvwxyz'
	rt = 'zyxwvutsrqponmlkjihgfedcba'

	def solve(s):
		s = list(s)
		for i in range(0, len(s) - 1, 2):
			(s[i], s[i + 1]) = (s[i + 1], s[i])
		return ''.join(s)

	def sl(k):
		k = list(k)
		for j in range(0, len(k)):
			u = lt.index(k[j])
			k[j] = rt[u]
		return ''.join(k)
	k = solve(s)
	b = sl(k)
	print(b)


try:
	for _ in range(int(input())):
		n = int(input())
		li = [i for i in input()]
		a = 0
		while a + 1 < len(li):
			(li[a], li[a + 1]) = (li[a + 1], li[a])
			a += 2
		li2 = li.copy()
		for i in li2:
			fh = 109
			sh = 110
			li.remove(i)
			if ord(i) > fh:
				li.append(chr(fh - (ord(i) - sh)))
			else:
				li.append(chr(sh + (fh - ord(i))))
		for i in li:
			print(i, end='')
		print()
except:
	pass


for _ in range(int(input())):
	n = int(input())
	s = input()
	f = ''
	for i in range(0, n // 2 * 2, 2):
		f += s[i + 1] + s[i]
	if n % 2 == 1:
		f += s[-1]
	a = 'abcdefghijklmnopqrstuvwxyz'
	for j in f:
		print(a[26 - 1 - a.index(j)], end='')
	print()


for t in range(int(input())):
	n = int(input())
	a = list(input())
	l = 'abcdefghijklmnopqrstuvwxyz'
	q = 'zyxwvutsrqponmlkjihgfedcba'
	if n % 2 == 0:
		c = 0
		while c < n:
			temp = a[c]
			a[c] = a[c + 1]
			a[c + 1] = temp
			c += 2
		for i in range(0, n):
			for j in range(0, len(l)):
				if a[i] == l[j]:
					print(q[j], end='')
					break
	else:
		c = 0
		while c < n - 1:
			temp = a[c]
			a[c] = a[c + 1]
			a[c + 1] = temp
			c += 2
		for i in range(0, n):
			for j in range(0, len(l)):
				if a[i] == l[j]:
					print(q[j], end='')
					break
	print('\r')


def reverse_alphabet(string):
	alphabet = 'abcdefghijklmnopqrstuvwxyz'
	reverse_alphabet = alphabet[::-1]
	mapping = str.maketrans(alphabet + alphabet.upper(), reverse_alphabet + reverse_alphabet.upper())
	reversed_string = string.translate(mapping)
	return reversed_string
n = int(input())
for i in range(n):
	a = int(input())
	s = input()
	lt = list(s)
	if len(lt) % 2 == 0:
		for j in range(0, len(lt) - 1, 2):
			(lt[j], lt[j + 1]) = (lt[j + 1], lt[j])
	elif len(lt) % 2 == 1:
		for k in range(0, len(lt) - 2, 2):
			(lt[k], lt[k + 1]) = (lt[k + 1], lt[k])
	string = ''.join(lt)
	print(reverse_alphabet(string))


for _ in range(int(input())):
	n = int(input())
	s = list(input())
	LOL = ['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']
	i = 0
	while i + 1 < n:
		temp = s[i]
		s[i] = s[i + 1]
		s[i + 1] = temp
		i += 2
	for j in range(n):
		s[j] = LOL[-(LOL.index(s[j]) + 1)]
	print(str.join('', s))


n = int(input())
for i in range(n):
	a = int(input())
	s = list(input())
	alpha = 'abcdefghijklmnopqrstuvwxyz'
	r = list(alpha)
	p = ''
	half = a // 2
	for i in range(half):
		(s[i * 2], s[i * 2 + 1]) = (s[i * 2 + 1], s[i * 2])
	for i in s:
		i = r[25 - r.index(i)]
		p = p + i
	print(p)


num = int(input())
for x in range(num):
	length = int(input())
	lst = list(input())
	kata = len(lst)
	if kata > length:
		print('code error')
	else:
		for y in range(0, length - 1, 2):
			(lst[y], lst[y + 1]) = (lst[y + 1], lst[y])
		alphabet = 'abcdefghijklmnopqrstuvwxyz'
		for i in range(length):
			lst[i] = alphabet[25 - alphabet.index(lst[i])]
		print(''.join(lst))


T = int(input())
for x in range(T):
	N = int(input())
	S = input()
	lst = list(S)
	for i in range(0, N - 1, 2):
		temp = lst[i]
		lst[i] = lst[i + 1]
		lst[i + 1] = temp
	for j in lst:
		m = abs(97 - ord(j))
		k = 122 - m
		print(chr(k), end='')
	print()


t = int(input())
for i in range(t):
	n = int(input())
	t = []
	s = input()
	s = list(s)
	for i in range(1, len(s), 2):
		(s[i], s[i - 1]) = (s[i - 1], s[i])
	for i in range(len(s)):
		m = ord(s[i])
		n = ord('a')
		t = m - n
		t1 = n + 25 - t
		s[i] = chr(t1)
	print(''.join(s))


for _ in range(int(input())):
	n = int(input())
	s = input()
	l = list(s)
	if n % 2 != 0:
		m = n - 1
	else:
		m = n
	for i in range(0, m, 2):
		t = l[i]
		l[i] = l[i + 1]
		l[i + 1] = t
	a = 'abcdefghijklmnopqrstuvwxyz'
	for j in range(0, n):
		l[j] = a[25 - a.index(l[j])]
	s = ''.join(l)
	s.replace('z', 'a')
	print(s)


T = int(input())
for i in range(T):
	N = int(input())
	S = input()
	S = list(S)
	l = ''
	if N % 2 == 0:
		for i in range(0, len(S), 2):
			(S[i], S[i + 1]) = (S[i + 1], S[i])
	else:
		for i in range(0, len(S) - 1, 2):
			(S[i], S[i + 1]) = (S[i + 1], S[i])
	for i in S:
		l += chr(122 - ord(i) + 97)
	print(l)


t = int(input())
for i in range(t):
	n = int(input())
	s = input()
	s1 = ''
	s2 = ''
	temp = s[0]
	for i in range(0, n - 1, 2):
		s1 += s[i + 1]
		s1 += s[i]
	if n % 2 == 1:
		s1 += s[n - 1]
	for i in range(n):
		if ord(s1[i]) >= 97 and ord(s1[i]) <= 122:
			s2 += chr(97 + 122 - ord(s1[i]))
		elif ord(s1[i]) >= 65 and ord(s1[i]) <= 90:
			s2 += chr(65 + 90 - ord(s1[i]))
	print(s2)


t = int(input())
for i in range(t):
	x = int(input())
	lst = list(map(str, input()))
	y = 0
	ans = ''
	for j in range(x // 2):
		(lst[y], lst[y + 1]) = (lst[y + 1], lst[y])
		y += 2
	for j in lst:
		ans += chr(219 - ord(j))
	print(ans)


for i in range(int(input())):
	n = int(input())
	s = input()
	l = list(s)
	for i in range(0, n - 1, 2):
		(l[i], l[i + 1]) = (l[i + 1], l[i])
	st = ''
	al = 'abcdefghijklmnopqrstuvwxyz'
	for i in range(len(l)):
		k = 25 - al.index(l[i])
		st += al[k]
	print(st)


num = int(input())
for x in range(num):
	length = int(input())
	lst = list(input())
	for y in range(0, length - 1, 2):
		temp = lst[y]
		lst[y] = lst[y + 1]
		lst[y + 1] = temp
	alphabet = 'abcdefghijklmnopqrstuvwxyz'
	for i in range(length):
		lst[i] = alphabet[25 - alphabet.index(lst[i])]
	print(''.join(lst))


def swap(i1, i2, s):
	temp = s[i1]
	s[i1] = s[i2]
	s[i2] = temp
	return s
t = int(input())
for i in range(t):
	n = int(input())
	s = input().upper()
	l = []
	for i in s:
		l.append(i)
	i = 0
	if n % 2 == 0:
		while i < n:
			l = swap(i, i + 1, l)
			i += 2
	else:
		while i < n - 1:
			l = swap(i, i + 1, l)
			i += 2
	l2 = []
	for i in l:
		x = 90 - ord(i) + 65
		a = chr(x)
		l2.append(a)
	r = ''
	for i in l2:
		r += i
	print(r.lower())


Test = int(input())
for Cases in range(Test):
	StringLength = int(input())
	String = str(input())
	String = list(String)
	Temp = ''
	for Letters in range(0, StringLength - 1, 2):
		Temp = String[Letters]
		String[Letters] = String[Letters + 1]
		String[Letters + 1] = Temp
	StringNew = []
	Alphabet = 'abcdefghijklmnopqrstuvwxyz'
	for Letters2 in range(StringLength):
		String[Letters2] = Alphabet[25 - Alphabet.index(String[Letters2])]
		StringNew.append(String[Letters2])
	String = ''.join(StringNew)
	print(String)


for i in range(int(input())):
	n = int(input())
	s = input()
	if n % 2 != 0:
		p = n - 1
	else:
		p = n
	q = list(s)
	for i in range(0, p, 2):
		(q[i], q[i + 1]) = (q[i + 1], q[i])
	alphabet = 'abcdefghijklmnopqrstuvwxyz'
	for x in range(0, n):
		q[x] = alphabet[25 - alphabet.index(q[x])]
	string = ''.join(q)
	print(string)


for i in range(int(input())):
	n = int(input())
	s = input()
	l = list(s)
	r = ''
	if len(l) % 2 == 0:
		for i in range(0, n, 2):
			(l[i], l[i + 1]) = (l[i + 1], l[i])
	else:
		for i in range(0, n - 1, 2):
			(l[i], l[i + 1]) = (l[i + 1], l[i])
	albet = 'abcdefghijklmnopqrstuvwxyz'
	for i in range(len(l)):
		ch = albet[25 - albet.index(l[i])]
		r = r + ch
	print(r)


for i in range(int(input())):
	x = int(input())
	s = input()
	s = list(s)
	if x % 2 == 0:
		for i in range(0, x, 2):
			(s[i], s[i + 1]) = (s[i + 1], s[i])
	else:
		for i in range(0, x - 1, 2):
			(s[i], s[i + 1]) = (s[i + 1], s[i])
	for i in range(x):
		if ord(s[i]) <= 109:
			s[i] = chr(122 - (ord(s[i]) - 97))
		else:
			s[i] = chr(97 + (122 - ord(s[i])))
	print(''.join(s))


T = int(input())
for _ in range(T):
	N = int(input())
	S = input()
	A = list()
	i = 0
	j = 1
	B = 'abcdefghijklmnopqrstuvwxyz'
	C = B[::-1]
	for _ in range(len(S)):
		if j > len(S) - 1:
			break
		A.append(S[j])
		A.append(S[i])
		i += 2
		j += 2
	if len(S) % 2 != 0:
		A.append(S[-1])
	for i in range(len(A)):
		index = B.index(A[i])
		A[i] = C[index]
	print(''.join(A))


for _ in range(int(input())):
	n = int(input())
	s1 = input()
	s = list(s1)
	l1 = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm']
	l2 = ['z', 'y', 'x', 'w', 'v', 'u', 't', 's', 'r', 'q', 'p', 'o', 'n']
	for j in range(0, len(s) - 1, 2):
		(s[j], s[j + 1]) = (s[j + 1], s[j])
	s2 = ''
	for ele in s:
		s2 += ele
	s3 = ''
	for k in s:
		if k in l1:
			i = l1.index(k)
			s3 += l2[i]
		else:
			i = l2.index(k)
			s3 += l1[i]
	print(s3)


alphabets = ['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(int(input())):
	n = int(input())
	l = list(input())
	for i in range(0, n - 1, 2):
		(l[i], l[i + 1]) = (l[i + 1], l[i])
	for i in range(0, n):
		for j in range(0, 26):
			if l[i] == alphabets[j]:
				l[i] = alphabets[25 - j]
				break
	s = ''
	for i in l:
		s += i
	print(s)


t = int(input())
for i in range(t):
	n = int(input())
	b = input()
	a = list(b)
	c = []
	string = ''
	for j in range(0, n - 1, 2):
		temp = a[j]
		a[j] = a[j + 1]
		a[j + 1] = temp
	for y in a:
		k = abs(97 - ord(y))
		index = abs(122 - k)
		c.append(chr(index))
	for z in c:
		string += z
	print(string)


for test in range(int(input())):
	n = int(input())
	s = input()
	a = list(s)
	sn = ''
	for i in range(1, n, 2):
		s1 = a[i - 1]
		a[i - 1] = a[i]
		a[i] = s1
	for i in range(n):
		if ord(a[i]) <= 110:
			diff = 97 - ord(a[i])
			add = 122 + diff
			a[i] = chr(add)
			sn += a[i]
		elif ord(a[i]) > 110:
			diff = 122 - ord(a[i])
			add = 97 + diff
			a[i] = chr(add)
			sn += a[i]
	print(sn)


for _ in range(int(input())):
	n = int(input())
	a = input()
	s = ''
	for i in range(1, n, 2):
		s = s + a[i] + a[i - 1]
	if n % 2 != 0:
		s = s + a[-1]
	d = ''
	for i in s:
		a = 219 - ord(i)
		d = d + chr(a)
	print(d)


import string
t = int(input())
for i in range(t):
	n = int(input())
	s = input()
	s = list(s)
	for j in range(len(s)):
		if j % 2 == 1:
			(s[j], s[j - 1]) = (s[j - 1], s[j])
	alpha = string.ascii_lowercase
	for j in range(len(s)):
		index = alpha.find(s[j])
		s[j] = alpha[25 - index]
	print(''.join(s))


n = int(input())
for i in range(n):
	t = int(input())
	lst = input()
	f = list(lst)
	temp = 0
	if t % 2 == 1:
		t2 = t - 1
	else:
		t2 = t
	for k in range(0, t2, 2):
		temp = f[k]
		f[k] = f[k + 1]
		f[k + 1] = temp
	a = 'abcdefghijklmnopqrstuvwxyz'
	for s in range(t):
		d = a.index(f[s]) + 1
		f[s] = a[0 - d]
	lst = ''.join(f)
	print(lst)


for _ in range(int(input())):
	n = int(input())
	l = list(map(str, input()))
	k = n
	if n % 2 != 0:
		k = n - 1
	for i in range(0, k, 2):
		(l[i], l[i + 1]) = (l[i + 1], l[i])
	for i in range(n):
		a = ord(l[i]) - 97
		a = 122 - a
		l[i] = chr(a)
	for i in range(n):
		print(l[i], end='')
	print()


alpha = 'abcdefghijklmnopqrstuvwxyz'
f = {}
g = {}
for (i, j) in enumerate(alpha):
	f[j] = i
	g[i] = j
for _ in range(int(input())):
	n = int(input())
	o = ''
	s = [i for i in input()]
	if n % 2 != 0:
		d = n - 1
	else:
		d = n
	for i in range(0, d, 2):
		(s[i], s[i + 1]) = (s[i + 1], s[i])
	for i in range(len(s)):
		t = str(s[i])
		u = f.get(t)
		l = 25 - u
		s[i] = g[l]
	for j in s:
		o += j
	print(o)


T = int(input())
for _ in range(T):
	n = int(input())
	s = list(input())
	for i in range(0, n, 2):
		s[i] = chr(122 - (ord(s[i]) - 97))
		if i % 2 == 0 and i + 1 < n:
			s[i + 1] = chr(122 - (ord(s[i + 1]) - 97))
			(s[i], s[i + 1]) = (s[i + 1], s[i])
	print(''.join(s))


t = int(input())
for q in range(t):
	n = int(input())
	s = input()
	l = list(s)
	for i in range(0, n, 2):
		if i == n - 1:
			continue
		t = l[i]
		l[i] = l[i + 1]
		l[i + 1] = t
	for i in l:
		print(chr(122 - ord(i) + 97), end='')
	print()