#include <bits/stdc++.h>
using namespace std;

//0 1->codeforces
#define LL "%lld"
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define PN printf("\n")
#define MAXL 1500

typedef long long ll;
typedef double dbl;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<vector<bool>> vvb;
int gi(){int a;scanf("%d",&a);return a;}
ll gll(){ll a;scanf(LL,&a);return a;}

char vs[2][605];
ll pw[2][MAXL];
struct mhash {
  static const int MODA=1000000007;
  static const int MODB=1000000009;
  static const int BA=31;
  static const int BB=29;
  static bool done;
  pi h;
  int len;
  mhash():h({0,0}),len(0){}
  mhash(char c){h.fi=h.se=(c-'a')+1;len=1;}
  void reset(){h.fi=h.se=len=0;}
  void merge(char c){
    h.fi=(ll(BA)*h.fi+(c-'a')+1)%MODA;
    h.se=(ll(BB)*h.se+(c-'a')+1)%MODB;
    len++;
  }
  void merge(const mhash &o){
    if(!done){ calcpw(); }
    if(o.len==0)return;
    h.fi = (h.fi*pw[0][o.len]+o.h.fi)%MODA;
    h.se = (h.se*pw[1][o.len]+o.h.se)%MODB;
    len+=o.len;
    assert(len<MAXL);
  }
  ll geth(){ll ret=h.fi;ret <<= 30;return(ret|h.se);}
  static void calcpw(){
    done=true;
    pw[0][0]=1;
    pw[1][0]=1;
    for(int i=1;i<MAXL;i++){
      pw[0][i]=(pw[0][i-1]*BA)%MODA;
      pw[1][i]=(pw[1][i-1]*BB)%MODB;
    }
  }
  mhash& operator=(const mhash &o){
    h.fi=o.h.fi; h.se=o.h.se;
    len=o.len;
    return *this;
  }
  bool operator<(const mhash &o)const{
    if(h.fi!=o.h.fi)return h.fi<o.h.fi;
    return h.se<o.h.se;
  }
  bool operator==(const mhash &o)const{return h.fi==o.h.fi && h.se==o.h.se;}
};
bool mhash::done=false;

void doit(){
  int n=gi();
  scanf("%s %s",vs[0],vs[1]);
  set<ll> res;

  //la, ra row 1 to row 0; lb,rb row 0 to row 1
  for(int ii=0;ii<2;ii++){
    vector<mhash> la(n),lb(n),ra(n),rb(n);
    for(int i=0;i<n;i++){
      la[i].merge(vs[1][i]);
      lb[i].merge(vs[0][i]);
      if(i)la[i].merge(la[i-1]), lb[i].merge(lb[i-1]);
      la[i].merge(vs[0][i]);
      lb[i].merge(vs[1][i]);
    }
    for(int i=n-1;i>=0;i--){
      ra[i].merge(vs[1][i]);
      rb[i].merge(vs[0][i]);
      if(i!=(n-1))ra[i].merge(ra[i+1]), rb[i].merge(rb[i+1]);
      ra[i].merge(vs[0][i]);
      rb[i].merge(vs[1][i]);
    }
    for(int left=0;left<=n;left++){
      //ha ends on row 0; hb ends on row 1
      mhash ha, hb;
      if(left){
        ha.merge(la[left-1]);
        hb.merge(lb[left-1]);
      }
      for(int mid=0;mid+left<=n;mid++){
        int right=n-(mid+left);
        if(mid){
          int mix=left+mid-1;
          ha.merge(vs[0][mix]);
          ha.merge(vs[1][mix]);
          hb.merge(vs[1][mix]);
          hb.merge(vs[0][mix]);
          swap(ha,hb);
        }
        mhash ta=ha, tb=hb;
        if(right){
          int rix=n-right;
          ta.merge(rb[rix]);
          tb.merge(ra[rix]);
        }
        assert(ta.len==2*n);assert(tb.len==2*n);
        res.insert(ta.geth()), res.insert(tb.geth());
      }

    }
    reverse(vs[0], vs[0]+n);
    reverse(vs[1], vs[1]+n);
  }
  cout<<res.size()<<endl;
}

int main() {
  int tc=gi();
  for(int i=0;i<tc;i++){doit();}
  return 0;
}