#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const long long MOD = 1e9 + 7;
const long long INF = 5e18;
const double DINF = 5e14;
const double eps = 1e-10;
const int di[4] = {1, 0, -1, 0}, dj[4] = {0, 1, 0, -1};
int t, n;
string s;
vector<char> c[30];
int main() {
  cin >> t;
  for (int i = 0; i < 26; i++) {
    if (i != 25) c[i].emplace_back((i + 1) % 26 + 'a');
    if (i != 0) c[i].emplace_back((i - 1 + 26) % 26 + 'a');
  }
  for (int z = 0; z < t; z++) {
    cin >> n >> s;
    bool fl = 0;
    for (int i = 0; i < n / 2; i++) {
      bool f = 0;
      for (int j = 0; j < c[s[i] - 'a'].size(); j++) {
        for (int k = 0; k < c[s[n - i - 1] - 'a'].size(); k++) {
          if (c[s[i] - 'a'][j] == c[s[n - i - 1] - 'a'][k]) {
            f = 1;
            break;
          }
        }
      }
      if (!f) fl = 1;
    }
    if (!fl)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
