#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" using namespace std; #include #line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp" namespace noya2 { template ostream &operator<<(ostream &os, const pair &p){ os << p.first << " " << p.second; return os; } template istream &operator>>(istream &is, pair &p){ is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const vector &v){ int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template istream &operator>>(istream &is, vector &v){ for (auto &x : v) is >> x; return is; } void in() {} template void in(T &t, U &...u){ cin >> t; in(u...); } void out() { cout << "\n"; } template void out(const T &t, const U &...u){ cout << t; if (sizeof...(u)) cout << sep; out(u...); } template void out(const vector> &vv){ int s = (int)vv.size(); for (int i = 0; i < s; i++) out(vv[i]); } struct IoSetup { IoSetup(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetup_noya2; } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp" namespace noya2{ const int iinf = 1'000'000'007; const long long linf = 2'000'000'000'000'000'000LL; const long long mod998 = 998244353; const long long mod107 = 1000000007; const long double pi = 3.14159265358979323; const vector dx = {0,1,0,-1,1,1,-1,-1}; const vector dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; void yes(){ cout << "Yes\n"; } void no(){ cout << "No\n"; } void YES(){ cout << "YES\n"; } void NO(){ cout << "NO\n"; } void yn(bool t){ t ? yes() : no(); } void YN(bool t){ t ? YES() : NO(); } } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" namespace noya2{ unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){ if (a == 0 || b == 0) return a + b; int n = __builtin_ctzll(a); a >>= n; int m = __builtin_ctzll(b); b >>= m; while (a != b) { int mm = __builtin_ctzll(a - b); bool f = a > b; unsigned long long c = f ? a : b; b = f ? b : a; a = (c - b) >> mm; } return a << min(n, m); } template T gcd_fast(T a, T b){ return static_cast(inner_binary_gcd(abs(a),abs(b))); } long long sqrt_fast(long long n) { if (n <= 0) return 0; long long x = sqrt(n); while ((x + 1) * (x + 1) <= n) x++; while (x * x > n) x--; return x; } template T floor_div(const T n, const T d) { assert(d != 0); return n / d - static_cast((n ^ d) < 0 && n % d != 0); } template T ceil_div(const T n, const T d) { assert(d != 0); return n / d + static_cast((n ^ d) >= 0 && n % d != 0); } template void uniq(vector &v){ sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); } template inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template inline bool range(T l, T x, T r){ return l <= x && x < r; } } // namespace noya2 #line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define repp(i,m,n) for (int i = (m); i < (int)(n); i++) #define reb(i,n) for (int i = (int)(n-1); i >= 0; i--) #define all(v) (v).begin(),(v).end() using ll = long long; using ld = long double; using uint = unsigned int; using ull = unsigned long long; using pii = pair; using pll = pair; using pil = pair; using pli = pair; namespace noya2{ /* ~ (. _________ . /) */ } using namespace noya2; #line 2 "c.cpp" #line 2 "/Users/noya2/Desktop/Noya2_library/string/rolling_hash.hpp" #line 4 "/Users/noya2/Desktop/Noya2_library/string/rolling_hash.hpp" namespace noya2{ struct RollingHash { using ull = unsigned long long; RollingHash(const string &s = ""){ build(s);} ull get(int l, int r){ assert(0 <= l && l <= r && r <= n); return cal_mod(inner_hash[r] + POSITIVISER - mul_mod(inner_hash[l], pow_base[r-l])); } static ull get_hash(const string &s){ int len = s.size(); set_hash(); extend_pow_base(len); ull res = 0; for (int i = 0; i < len; i++) res = cal_mod(mul_mod(res,BASE) + s[i]); return res; } template static ull concat(const Hash_Lengths&... hash_length){ return inner_concat(0ULL,hash_length...); } private: static ull inner_concat(const ull& temp){ return temp; } template static ull inner_concat(const ull& temp, const ull& hash, const int& len, const Tail&... tail){ return inner_concat(cal_mod(cal_mod(mul_mod(temp,pow_base[len]))+hash),tail...); } static constexpr ull MASK30 = (1ULL << 30) - 1; static constexpr ull MASK31 = (1ULL << 31) - 1; static constexpr ull MASK61 = (1ULL << 61) - 1; static constexpr ull MOD = (1ULL << 61) - 1; static constexpr ull POSITIVISER = MOD * 4; static ull BASE; static vector pow_base; static ull mul_mod(ull a, ull b){ ull au = a >> 31, ad = a & MASK31; ull bu = b >> 31, bd = b & MASK31; ull mid = ad * bu + au * bd; ull midu = mid >> 30, midd = mid & MASK30; return (au * bu * 2 + midu + (midd << 31) + ad * bd); } static ull cal_mod(ull x){ ull xu = x >> 61; ull xd = x & MASK61; ull res = xu + xd; if (res >= MOD) res -= MOD; return res; } static void set_hash(){ if (BASE == 0) BASE = (1UL<<31) + (random_device()() & MASK31); } static void extend_pow_base(int len){ int nlen = pow_base.size(); if (nlen > len) return ; pow_base.resize(len+1); for (int i = nlen; i <= len; i++){ pow_base[i] = cal_mod(mul_mod(pow_base[i-1],BASE)); } } string str; int n; vector inner_hash; void build(const string &s){ set_hash(); str = s; n = s.size(); extend_pow_base(n); inner_hash.resize(n+1); inner_hash[0] = 0; for (int i = 0; i < n; i++) inner_hash[i+1] = cal_mod(mul_mod(inner_hash[i],BASE) + s[i]); } }; using ull = unsigned long long; ull RollingHash::BASE = 0; vector RollingHash::pow_base = vector(1,1); using roriha = RollingHash; } // namespace noya2 #line 4 "c.cpp" void solve(){ int n; in(n); string s; in(s); roriha hs(s); auto lcp = [&](int i){ int le = 0, ri = min(n-i,i)+1; while (ri - le > 1){ int md = (le + ri) / 2; if (hs.get(0,md) == hs.get(i,i+md)) le = md; else ri = md; } return le; }; int ans = 0; repp(i,1,n){ int l = lcp(i); int r1 = l, r2 = i+l; if (r2 == n) continue; if (r1 == i){ ans++; } else { if (s[r1] < s[r2]) ans++; } } out(ans); } int main(){ int t = 1; in(t); while (t--) { solve(); } }