#include<bits/stdc++.h>
#define ll long long

using namespace std;
const  int N=2e3;
const ll inf=1e18;
int T;
int n;
int d[N+10][N+10],du[N+10];
int p[N+10];
ll f[N+10];
int fm[N+10],fu[N+10],fv[N+10];
vector<int>ans;
inline bool cmp_p(const int &x,const int &y){
	return du[x]<du[y];
}
inline void solve(int u){
	if(fm[u]){
		solve(fm[u]);
		ans.push_back(u);
	}
}
int main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>T;
	bool fl=(0&&T==100);
	while(T--){
		cin>>n;
		for(int i=1;i<=n;++i){
			du[i]=0;
			p[i]=i;
			f[i]=inf;
		}
		for(int i=1;i<=n;++i){
			for(int j=1;j<=n;++j){
				cin>>d[i][j];
				if(d[i][j]){
					++du[j];
				}
			}
		}
		if(fl&&T==100-48){
			cout<<n<<'|';
			for(int i=1;i<=n;++i){
				for(int j=1;j<=n;++j){
					if(d[i][j]){
						cout<<i<<'_'<<j<<'_'<<d[i][j]<<'|';
					}
				}
			}
		}
		if(fl)continue;
		if(n==2){
			cout<<"NO\n";
			continue;
		}
		sort(p+1,p+n+1,cmp_p);
		for(int i=1,la=0,sum=0;i<=n;++i){
			sum+=du[p[i]];
			if(sum==i*(i-1)/2){
				if(!la){
					f[i]=0;
					fm[i]=0;
				}
				else{
					for(int j=la,jj;j;--j){
						if(f[j]<inf){
							jj=j;
						}
						for(int k=la+1;k<=i;++k){
							if(f[i]>f[jj]+d[p[j]][p[k]]){
								f[i]=f[jj]+d[p[j]][p[k]];
								fm[i]=jj;
								fu[i]=p[j];
								fv[i]=p[k];
							}
						}
					}
				}
				la=i;
			}
		}
		cout<<"YES\n";
		ans.clear();
		solve(n);
		cout<<(int)ans.size()<<' '<<f[n]<<'\n';
		for(auto x:ans){
			cout<<fu[x]<<' '<<fv[x]<<'\n';
		}
	}
	return 0;
}