import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(1000005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = -1-(-1 << 63)
# md = 10**9+7
md = 998244353

def z_algorithm(target):
    len_t = len(target)
    lcp = [-1]*len_t
    top = 1
    right = 0
    lcp[0] = 0
    while top < len_t:
        while top+right < len_t and target[right] == target[top+right]:
            right += 1
        lcp[top] = right
        left = 1
        if right == 0:
            top += 1
            continue
        while left+lcp[left] < right and left < right:
            lcp[top+left] = lcp[left]
            left += 1
        top += left
        right -= left
    return lcp

def solve():
    n=II()
    s=SI()
    lcp=z_algorithm(s)
    ans=0
    for i in range(1,n):
        l=lcp[i]
        r=lcp[i]+i
        if l>=i or r>=n:
            ans+=min(l,i)<min(l,n-i)
        else:
            ans+=s[l]<s[r]
    print(ans)

for _ in range(II()):solve()