#include #include using namespace std; typedef long long ll; typedef long double ld; // read template long long readInt(long long l,long long r,char endd){ long long x=0; int cnt=0; int fi=-1; bool is_neg=false; while(true){ char g=getchar(); if(g=='-'){ assert(fi==-1); is_neg=true; continue; } if('0'<=g && g<='9'){ x*=10; x+=g-'0'; if(cnt==0){ fi=g-'0'; } cnt++; assert(fi!=0 || cnt==1); assert(fi!=0 || is_neg==false); assert(!(cnt>19 || ( cnt==19 && fi>1) )); } else if(g==endd){ assert(cnt>0); if(is_neg){ x= -x; } assert(l<=x && x<=r); return x; } else { assert(false); } } } string readString(int l,int r,char endd){ string ret=""; int cnt=0; while(true){ char g=getchar(); assert(g!=-1); if(g==endd){ break; } cnt++; ret+=g; } assert(l<=cnt && cnt<=r); return ret; } long long readIntSp(long long l,long long r){ return readInt(l,r,' '); } long long readIntLn(long long l,long long r){ return readInt(l,r,'\n'); } string readStringLn(int l,int r){ return readString(l,r,'\n'); } string readStringSp(int l,int r){ return readString(l,r,' '); } // end void solve() { int n = readIntLn(1, 100); string s = readStringLn(n, n); bool ch = true; for (int i = 0; i < n; i++) ch &= ('a' <= s[i] && s[i] <= 'z'); assert(ch); for (int i = 0; i < n - 1; i += 2) swap(s[i], s[i + 1]); for (int i = 0; i < n; i++) s[i] = (char)((int)'a' + (int)'z' - (int)s[i]); cout << s << "\n"; } int main() { int T = readIntLn(1, 1000); while (T--) solve(); assert(getchar() == -1); return 0; }