#include <bits/stdc++.h>
using namespace std;
int const MAX = 241;
int n;
char s[MAX];
char getnext(char c) {
  if (c == 'z') return '0';
  return c + 1;
}
char getprev(char c) {
  if (c == 'a') return '1';
  return c - 1;
}
void solve() {
  for (int i = 1; i <= n / 2; i++) {
    bool f = false;
    char a = s[i];
    char b = s[n - i + 1];
    f |= (getnext(a) == getnext(b));
    f |= (getnext(a) == getprev(b));
    swap(a, b);
    f |= (getnext(a) == getnext(b));
    f |= (getnext(a) == getprev(b));
    if (!f) {
      printf("NO\n");
      return;
    }
  }
  printf("YES\n");
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &n);
    scanf(" %s", s + 1);
    solve();
  }
  return 0;
}
