#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll mod=998244353;
ll mod2=1000000007;
ld inf=10000999999999900;
int main(){
    ll t;
    cin >> t;
    vector<ll>ans;
    for (ll o = 0; o < t; o++)
    {
        ll n;
        cin >> n;
        string s;
        cin >> s;
        vector<ll>ten(n+100,1),ten2(n+100,1);
        for (ll i = 1; i < ten.size(); i++)
        {
            ten[i]=ten[i-1]*997;
            ten[i]%=mod;

            ten2[i]=ten2[i-1]*997;
            ten2[i]%=mod2;
        }
        vector<ll>hs(n),hs2(n);
        hs[0]=s[0]-'a';
        hs2[0]=s[0]-'a';
        for (ll i = 1; i <n; i++)
        {
            hs[i]=hs[i-1]*997;
            hs[i]%=mod;
            hs[i]+=(s[i]-'a');
            hs[i]%=mod;

            hs2[i]=hs2[i-1]*997;
            hs2[i]%=mod2;
            hs2[i]+=(s[i]-'a');
            hs2[i]%=mod2;
        }
        ll x=0;
        for (ll i = 1; i*2 < n; i++)
        {
            ll y=hs[i-1];
            ll z=hs[i*2-1];
            z+=mod-(hs[i-1]*ten[i])%mod;
            z%=mod;

            ll yy=hs2[i-1];
            ll zz=hs2[i*2-1];
            zz+=mod2-(hs2[i-1]*ten2[i])%mod2;
            zz%=mod2;
            if (y==z&&yy==zz)
            {
                x++;
            }
        }
        vector<int>sa=suffix_array(s);
        for (ll i = 0; i < n; i++)
        {
            if (sa[i]==0)
            {
                x+=n-i-1;
                break;
            }
        }
        ans.push_back(x);
    }
    for (ll i = 0; i < ans.size(); i++)
    {
        cout << ans[i] << endl;
    }
    
}