#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

const int MAXN = 1e5 + 7 ;

int n ;
string a ;

int pref[ MAXN ][ 10 ] , suff[ MAXN ][ 10 ] ;
pii dp[ 10 ][ 10 ][ 10 ] ;

void solve ( ) {
    cin >> n ;
    cin >> a ;
    a = '#' + a ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        for ( int j = 0 ; j < 10 ; ++ j ) {
            pref[ i ][ j ] = pref[ i - 1 ][ j ] ;
        }
        ++ pref[ i ][ ( a[ i ] - '0' ) ] ;
        for ( int j = 1 ; j < 10 ; ++ j ) {
            pref[ i ][ j ] = max ( pref[ i ][ j ] , pref[ i ][ j - 1 ] ) ;
        }
    }
    for ( int i = 0 ; i < 10 ; ++ i ) {
        suff[ n + 1 ][ i ] = 0 ;
    }
    for ( int i = n ; i >= 1 ; -- i ) {
        for ( int j = 0 ; j < 10 ; ++ j ) {
            suff[ i ][ j ] = suff[ i + 1 ][ j ] ;
        }
        ++ suff[ i ][ ( a[ i ] - '0' ) ] ;
        for ( int j = 8 ; j >= 0 ; -- j ) {
            suff[ i ][ j ] = max ( suff[ i ][ j ] , suff[ i ][ j + 1 ] ) ;
        }
    }
    for ( int i = 0 ; i < 10 ; ++ i ) { 
        for ( int j = 0 ; j < 10 ; ++ j ) {
            for ( int t = 0 ; t < 10 ; ++ t ) { 
                dp[ i ][ j ][ t ] = { 0 , 0 } ;
            }
        }
    }
    int ans = pref[ n ][ 9 ] , l = 1 , r = 1 ;
    for ( int i = n ; i >= 1 ; -- i ) {
        int x = ( a[ i ] - '0' ) ;
        for ( int st = 0 ; st <= x ; ++ st ) {
            for ( int en = x ; en < 10 ; ++ en ) {
                pii mx ;
                for ( int mid = st ; mid <= x ; ++ mid ) {
                    mx = max ( mx , dp[ st ][ en ][ mid ] ) ;
                }
                if ( mx.fi == 0 ) { continue ; }
                dp[ st ][ en ][ x ] = { mx.fi + 1 , mx.se } ;
                if ( ans < mx.fi + 1 + pref[ i - 1 ][ st ] ) {
                    ans = mx.fi + 1 + pref[ i - 1 ][ st ] ;
                    l = i , r = mx.se ;
                }
            }
        }
        for ( int en = x ; en < 10 ; ++ en ) {
            dp[ x ][ en ][ x ] = max ( dp[ x ][ en ][ x ] , make_pair ( suff[ i + 1 ][ en ] + 1 , i ) ) ;
        }
    }
    cout << ans << " " << l << " " << r << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; cin >> t ; 
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}