t = int(input())
for _ in range(t):
    n = int(input())
    l = list(map(int,list(input().strip())))

    rev = [0] * 10

    for i in range(n - 1, -1, -1):
        c = l[i]
        best = 0
        for j in range(9, -1, -1):
            best = max(best, rev[-10] + (c == j))
            rev.append(best)

    out = (-1, 1, 1)

    best = [0] * 1000
    loc = [-1] * 1000

    curr = [0] * 10

    for i in range(n):
        c = l[i]
        
        #Do stuff


        for u in range(10):
            for v in range(u + 1, 10):
                ind = 100 * v + 10 * u

                bb = 0
                ii = 0
                for w in range(v, u - 1, -1):
                    nex = best[ind + w] + (c == w)
                    if nex > bb:
                        bb = nex
                        ii = loc[ind + w]

                    best[ind + w] = bb
                    loc[ind + w] = ii

                out = max(out, (best[ind + u] + rev[~(10 * (i + 1) + v)], loc[ind + u] + 2, i + 1))

        curr[c] += 1
        for j in range(9):
            curr[j + 1] = max(curr[j + 1], curr[j])


        for u in range(10):
            for v in range(u + 1, 10):
                best[101 * v + 10 * u] = curr[u]
                loc[101 * v + 10 * u] = i

    print(' '.join(map(str, out)))