#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

struct Fast {
  Fast() {
    std::cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(10);
  }
} fast;

#define all(a) (a).begin(), (a).end()
#define contains(a, x) ((a).find(x) != (a).end())
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (a); i--)
#define writejoin(s, a) rep(_i, 0, (a).size()) cout << (a)[_i] << (_i + 1 < (int)(a).size() ? s : "\n");
#define YN(b) cout << ((b) ? "YES" : "NO") << "\n";
#define Yn(b) cout << ((b) ? "Yes" : "No") << "\n";
#define yn(b) cout << ((b) ? "yes" : "no") << "\n";

using ll = long long;

int op(int x, int y) { return min(x, y); }
int e() { return 1e9; }

int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    string s;
    cin >> n >> s;

    auto sa = suffix_array(s);
    auto lcp = lcp_array(s, sa);

    segtree<int, op, e> seg(lcp);
    int x = 0;
    while (sa[x]) x++;

    int ans = 0;
    rep(i, 0, x) {
      int l = seg.prod(i, x);
      int a = sa[i];
      int u_len = a;
      int v_len = n - u_len;
      if (l >= u_len && u_len < v_len) {
        ans++;
      }
    }
    rep(i, x + 1, n) {
      int l = seg.prod(x, i);
      int a = sa[i];
      int u_len = a;
      int v_len = n - u_len;
      if (l < u_len || u_len < v_len) {
        ans++;
      }
    }
    cout << ans << "\n";
  }
}