#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 = 2007 ;
const int inf = 2e9 + 7 ;
const ll big_inf = 2e18 + 7 ;

int n ;
int ori[ MAXN ][ MAXN ] ;
int used[ MAXN ] , comp[ MAXN ] ;
stack < int > s ;

int st , en ;
int a[ MAXN ][ MAXN ] ;
pii best_edge[ MAXN ][ MAXN ] ;

void dfs ( int x ) {
    used[ x ] = 1 ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        if ( ori[ x ][ i ] > 0 && used[ i ] == 0 ) {
            dfs ( i ) ;
        }
    }
    s.push ( x ) ;
}

void rev_dfs ( int x , int wh ) {
    comp[ x ] = wh ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        if ( ori[ i ][ x ] > 0 && comp[ i ] == 0 ) {
            rev_dfs ( i , wh ) ;
        }
    }
}

ll dist[ MAXN ] , prv[ MAXN ] , aux[ MAXN ] ;
bool done[ MAXN ] ;


void solve ( ) {
    cin >> n ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        for ( int j = 1 ; j <= n ; ++ j ) {
            cin >> ori[ i ][ j ] ;
        }
    }
    if ( n == 2 ) {
        cout << "NO\n" ;
        return ;
    }
    for ( int i = 1 ; i <= n ; ++ i ) {
        used[ i ] = comp[ i ] = 0 ;
        for ( int j = 1 ; j <= n ; ++ j ) {
            a[ i ][ j ] = inf ;
            best_edge[ i ][ j ] = { 0 , 0 } ;
        }
    }
    st = en = 0 ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        if ( used[ i ] == 0 ) {
            dfs ( i ) ;
        }
    }
    int tp = 0 ; 
    while ( s.empty ( ) == false ) {
        int x = s.top ( ) ;
        s.pop ( ) ;
        if ( comp[ x ] != 0 ) { continue ; }
        rev_dfs ( x , ++ tp ) ;
    }
    for ( int i = 1 ; i <= n ; ++ i ) {
        for ( int j = 1 ; j <= n ; ++ j ) {
            if ( comp[ i ] == comp[ j ] ) { continue ; }
            if ( ori[ i ][ j ] > 0 && a[ comp[ i ] ][ comp[ j ] ] > ori[ i ][ j ] ) {
                a[ comp[ i ] ][ comp[ j ] ] = ori[ i ][ j ] ;
                best_edge[ comp[ i ] ][ comp[ j ] ] = { i , j } ;
            }
        }
    }
    for ( int i = 1 ; i <= tp ; ++ i ) {
        int in_cnt = 0 , out_cnt = 0 ;
        for ( int j = 1 ; j <= tp ; ++ j ) {
            if ( a[ i ][ j ] != inf ) { ++ out_cnt ; }
            if ( a[ j ][ i ] != inf ) { ++ in_cnt ; }
        }
        if ( in_cnt == 0 ) { st = i ; }
        if ( out_cnt == 0 ) { en = i ; }
    }
    for ( int i = 1 ; i <= tp ; ++ i ) {
        dist[ i ] = big_inf ;
        prv[ i ] = aux[ i ] = 0 ;
        done[ i ] = false ;
    }
    dist[ st ] = 0 ;
    while ( 1 ) {
        ll opt = big_inf ;
        int x ;
        for ( int i = 1 ; i <= tp ; ++ i ) {
            if ( done[ i ] == true ) { continue ; }
            if ( opt > dist[ i ] ) {
                opt = dist[ i ] ;
                x = i ;
            }
        }
        if ( opt == big_inf ) { break ; }
        done[ x ] = true ;
        for ( int i = 1 ; i <= tp ; ++ i ) {
            if ( a[ x ][ i ] != inf && dist[ i ] > dist[ x ] + a[ x ][ i ] ) {
                aux[ i ] = aux[ x ] + 1 ;
                dist[ i ] = dist[ x ] + a[ x ][ i ] ;
                prv[ i ] = x ;
            }
        }
    }
    cout << "YES\n" ;
    cout << aux[ en ] << " " << dist[ en ] << "\n" ;
    vector < pii > ans ;
    while ( en != st ) {
        ans.push_back ( best_edge[ prv[ en ] ][ en ] ) ;
        en = prv[ en ] ;
    }
    reverse ( ans.begin ( ) , ans.end ( ) ) ;
    for ( auto [ x , y ] : ans ) {
        cout << x << " " << y << "\n" ;
    }
}


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