#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a, I = b; i <= I; ++i)
#define per(i, a, b) for (int i = a, I = b; i >= I; --i)
using namespace std;
using i64 = long long;
using i128 = __int128_t;
using pii = pair<int, int>;
template<typename T> void up(T &x, T y) { if (x < y) x = y; }
template<typename T> void down(T &x, T y) { if (x > y) x = y; }
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
int rng(int l, int r) { return l + rnd() % (r - l + 1); }

const int N = 100005;
char s[N];
int n, f[N][10], g[N][10], l, r, ans;
pii dp[10];

void up(int L, int R, int ANS) {
    if (ANS > ans) {
        ans = ANS;
        l = L, r = R;
    }
}

void solve() {
    cin >> n >> (s + 1);
    rep(i, 1, n) s[i] -= '0';
    
    rep(i, 1, n) {
        memcpy(f[i], f[i - 1], sizeof f[i]);
        ++f[i][s[i]];
        rep(j, 1, 9) up(f[i][j], f[i][j - 1]);
    }
    memset(g[n + 1], 0, sizeof g[n + 1]);
    per(i, n, 1) {
        memcpy(g[i], g[i + 1], sizeof g[i]);
        ++g[i][s[i]];
        per(j, 8, 0) up(g[i][j], g[i][j + 1]);
    }

    l = r = 1, ans = f[n][9];
    rep(a, 0, 9) rep(b, a + 1, 9) {
        rep(j, a, b) dp[j] = {-1e9, 0};
        rep(i, 1, n) {
            up(dp[b], pii(f[i - 1][a], i));
            per(i, b - 1, a) up(dp[i], dp[i + 1]);
            if (s[i] >= a && s[i] <= b) ++dp[s[i]].first;
            per(i, b - 1, a) up(dp[i], dp[i + 1]);
            up(dp[a].second, i, dp[a].first + g[i + 1][b]);
        }
    }
    cout << ans << " " << l << " " << r << "\n";
}

int main() {
	ios::sync_with_stdio(0), cin.tie(0);

    int T; cin >> T;
    while (T--) solve();

	return 0;
}