#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

struct UF {
	vi e;
	UF(int n) : e(n, -1) {}
	bool sameSet(int a, int b) { return find(a) == find(b); }
	int size(int x) { return -e[find(x)]; }
	int find(int x) { return e[x] < 0 ? x : e[x] = find(e[x]); }
	bool join(int a, int b) {
		a = find(a), b = find(b);
		if (a == b) return false;
		if (e[a] > e[b]) swap(a, b);
		e[a] += e[b]; e[b] = a;
		return true;
	}
};

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

	ll t;cin>>t;
	while(t--){
		ll n;cin>>n;
		vector<vi> m(n,vi(n));
		rep(i,0,n)rep(j,0,n)cin>>m[i][j];
		bool b=false;
		rep(i,0,n)if(m[i][i]!=0)b=true;
		rep(i,0,n)rep(j,i+1,n)if(m[i][j]!=m[j][i])b=true;

		UF cc(n),c2(n),c3(n);
		rep(i,0,n)rep(j,i+1,n)if(m[i][j]>0)cc.join(i,j);
		rep(i,0,n)rep(j,i+1,n)if(cc.sameSet(i,j)&&m[i][j]<1)b=true;
		rep(i,0,n)rep(j,i+1,n)if(m[i][j]>1)c2.join(i,j);
		rep(i,0,n)rep(j,i+1,n)if(c2.sameSet(i,j)&&m[i][j]<2)b=true;
		rep(i,0,n)rep(j,i+1,n)if(m[i][j]>2)c3.join(i,j);
		rep(i,0,n)rep(j,i+1,n)if(c3.sameSet(i,j)&&m[i][j]<3)b=true;
		vi am(n,0);
		rep(i,0,n)rep(j,0,n)am[i]=max(am[i],m[i][j]);
		if(b){
			cout<<"No\n";
			continue;
		}

		vector<pii> el;
		
		map<int,vi> mc3;
		rep(i,0,n)mc3[c3.find(i)].pb(i);

		map<int,pair<pair<vector<pii>,vector<pii>>,vi>> mc2;
		for(auto [p,a]:mc3){
			if(sz(a)==1){
				mc2[c2.find(p)].S.pb(p);
			}else if(sz(a)==2){
				el.pb({a[0],a[1]});
				mc2[c2.find(p)].F.F.pb({a[0],a[1]});
				mc2[c2.find(p)].F.F.pb({a[0],a[1]});
			}else if(sz(a)==3){
				el.pb({a[0],a[1]});
				el.pb({a[1],a[2]});
				el.pb({a[2],a[0]});
				mc2[c2.find(p)].F.F.pb({a[0],a[1]});
				mc2[c2.find(p)].F.F.pb({a[0],a[2]});
			}else{
				rep(i,2,sz(a)){
					el.pb({a[0],a[i]});
					el.pb({a[i-1],a[i]});
				}
				mc2[c2.find(p)].F.S.pb({a[0],a[1]});
				mc2[c2.find(p)].F.S.pb({a.back(),a[1]});
			}
		}

		map<int,vi> mc;
		for(auto &[p, g]:mc2){
			mc[cc.find(p)].pb(p);
			auto &[aa,a3]=g;
			auto &[a1,a2]=aa;
			for(int i=2;i<sz(a1);i+=2){
				el.pb({a1[i-1].F,a1[i].F});
				el.pb({a1[i-1].S,a1[i].S});
			}
			if(sz(a1)>2){
				swap(a1[1],a1.back());
				a1.resize(2);
			}
			for(int i=4;i<sz(a2);i+=2){
				el.pb({a2[i-1].F,a2[i].F});
				el.pb({a2[i-1].S,a2[i].S});
			}
			if(sz(a2)>4){
				swap(a2[3],a2.back());
				a2.resize(4);
			}
			if(sz(a2)==0){
				if(sz(a1)==0){
					if(sz(a3)==1){
						continue;
					}else if(sz(a3)==2){
						b=true;
						break;
					}else{
						el.pb({a3.back(),a3[0]});
						rep(i,1,sz(a3))el.pb({a3[i-1],a3[i]});
					}
				}else if(sz(a3)<2){
					b=true;
					break;
				}else{
					el.pb({a1[0].F,a3[0]});
					el.pb({a1[0].S,a3[0]});
					el.pb({a1[1].F,a3[1]});
					el.pb({a1[1].S,a3.back()});
					rep(i,2,sz(a3)){
						el.pb({a3[i-1],a3[i]});
					}
				}
			}else if(sz(a2)==2){
				el.pb({a2[0].F,a2[0].S});
				if(sz(a1)==0){
					if(sz(a3)==0){
						el.pb({a2[1].F,a2[1].S});
					}else{
						el.pb({a2[1].F,a3[0]});
						el.pb({a2[1].S,a3.back()});
						rep(i,1,sz(a3))el.pb({a3[i-1],a3[i]});
					}
				}else{
					if(sz(a3)==0){
						b=true;
						break;
					}else{
						el.pb({a2[1].F,a1[0].F});
						el.pb({a2[1].S,a1[0].S});
						el.pb({a1[1].F,a3[0]});
						el.pb({a1[1].S,a3.back()});
						rep(i,1,sz(a3)){
							el.pb({a3[i-1],a3[i]});
						}
					}
				}
			}else{
				el.pb({a2[0].F,a2[0].S});
				if(sz(a1)==0){
					el.pb({a2[1].F,a2[2].F});
					el.pb({a2[1].S,a2[2].S});
					if(sz(a3)==0){
						el.pb({a2[3].F,a2[3].S});
					}else{
						el.pb({a2[3].F,a3[0]});
						el.pb({a2[3].S,a3.back()});
						rep(i,1,sz(a3))el.pb({a3[i-1],a3[i]});
					}
				}else{
					el.pb({a2[1].F,a1[0].F});
					el.pb({a2[1].S,a1[0].S});
					el.pb({a2[2].F,a1[1].F});
					el.pb({a2[2].S,a1[1].S});
					if(sz(a3)==0){
						el.pb({a2[3].F,a2[3].S});
					}else{
						el.pb({a2[3].F,a3[0]});
						el.pb({a2[3].S,a3.back()});
						rep(i,1,sz(a3))el.pb({a3[i-1],a3[i]});
					}
				}
			}
		}
		if(b){
			cout<<"No\n";
			continue;
		}

		for(auto [_, a]:mc){
			rep(i,1,sz(a)){
				el.pb({a[i-1],a[i]});
			}
		}

		cout<<"Yes\n";
		cout<<sz(el)<<"\n";
		for(auto [u,v]:el)cout<<u+1<<" "<<v+1<<"\n";
	}
}