t=int(input())
for j in range(t):
a=input()
o=''
l=0
for i in range(len(a)):
if l%2==0:
if a[i]=='a':
o=o+'b'
else:
o=o+'a'
else:
if a[i]=='z':
o=o+'y'
else:
o=o+'z'
l=l+1
print(o)
#include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
string s;
for (int i = 0; i < t; i++) {
cin >> s;
for (int j = 0; j < s.size(); j++) {
if (j % 2) {
if (s[j] == 'z')
cout << 'y';
else
cout << 'z';
}
else {
if (s[j] == 'a')
cout << 'b';
else
cout << 'a';
}
}
cout << endl;
}
return 0;
}
236A - Boy or Girl | 271A - Beautiful Year |
520B - Two Buttons | 231A - Team |
479C - Exams | 1030A - In Search of an Easy Problem |
158A - Next Round | 71A - Way Too Long Words |
160A - Twins | 1A - Theatre Square |
1614B - Divan and a New Project | 791A - Bear and Big Brother |
1452A - Robot Program | 344A - Magnets |
96A - Football | 702B - Powers of Two |
1036A - Function Height | 443A - Anton and Letters |
1478B - Nezzar and Lucky Number | 228A - Is your horseshoe on the other hoof |
122A - Lucky Division | 1611C - Polycarp Recovers the Permutation |
432A - Choosing Teams | 758A - Holiday Of Equality |
1650C - Weight of the System of Nested Segments | 1097A - Gennady and a Card Game |
248A - Cupboards | 1641A - Great Sequence |
1537A - Arithmetic Array | 1370A - Maximum GCD |