#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())
typedef long long int ll;
typedef pair<ll,ll> pii;
typedef vector<int> vi;
#define fi first
#define se second
const int MAXN = 2e5+5;
map<int,vector<int>>adj[2];
map<int,int>deg[2],vis[2];
int rg[MAXN],tree[MAXN];
vector<int>comp;
void dfs(int c,int v,int p){
	if(!c)comp.push_back(v);
	vis[c][v] = 1;
	for(int x:adj[c][v]){
		if(x==p)continue;
		if(!vis[c^1][x]){
			int i = (v-x)/2;
			i = abs(i);
			tree[i] = 1;
			dfs(c^1,x,v);
		}
	}
}
void dfs2(int c,int v,int p){
	for(int x:adj[c][v]){
		if(x==p)continue;
		int i = (v-x)/2;
		i = abs(i);
		if(!tree[i])continue;
		dfs2(c^1,x,v);
		if(deg[c^1][x]){
			rg[i] = 1;
			deg[c][v] ^= 1;
		}
	}
	
	
}
int main()
{
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	int t;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		bool ok = 1;
		vector<int>a(n);
		for(int i=0;i<n;i++)cin>>a[i];
		for(int i=0;i<2;i++){
			adj[i].clear();
			vis[i].clear();
			deg[i].clear();
		}
		for(int i=0;i<n;i++)rg[i] = tree[i] = 0;
		
		for(int i=0;i<n;i++){
			adj[0][a[i]-i].push_back(a[i]+i);
			adj[1][a[i]+i].push_back(a[i]-i);
		}
		for(auto x:adj[0])deg[0][x.fi] = sz(x.se)%2;
		for(int i=0;i<n;i++){
			if(vis[0][a[i]-i])continue;
			comp.clear();
			dfs(0,a[i]-i,-2e9);
			int sum = 0;
			for(int v:comp){
				sum += deg[0][v];
				for(int x:adj[0][v]){
					int j = (v-x)/2;
					j = abs(j);
					if(!tree[j]){
						rg[j] = 1;
						deg[0][v] ^= 1;
						deg[1][x] ^= 1;
					}
				}
			}
			dfs2(0,comp[0],-2e9);
			if(sum&1){
				ok = 0;
				break;
			}
		}
		if(!ok){
			cout<<"No"<<'\n';
			continue;
		}
		map<int,vector<int>>l,r;
		for(int i=0;i<n;i++){
			//cout<<a[i]-i<<" "<<a[i]+i<<" "<<rg[i]<<'\n';
			if(rg[i])r[a[i]+i].push_back(i);
			else l[a[i]-i].push_back(i);
		}
		cout<<"Yes"<<'\n';
		for(auto x:l){
			vector<int>v = x.se;
			for(int i=0;i<sz(v);i+=2){
				cout<<v[i]+1<<" "<<v[i+1]+1<<'\n';
			}
		}
		for(auto x:r){
			vector<int>v = x.se;
			for(int i=0;i<sz(v);i+=2){
				cout<<v[i]+1<<" "<<v[i+1]+1<<'\n';
			}
		}
	}
		
	
}