#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int N=3e5+5;
int n,tot,cnt;
int a[N],vst[N],del[N];
map<int,int>A,B;
vector<int>son[N];
vector<pair<int,int>>ans;
void dfs(int x,int fa){
	vst[x]=1,cnt+=x<=n;
	vector<int> d;
	for(int y:son[x]){
		if(!vst[y]){
			dfs(y,x);
			if(x>n&&!del[y])d.push_back(y);
		}
	}
	if(x>n){
		for(int i=0;i+1<d.size();i+=2)ans.push_back({d[i],d[i+1]});
		if(d.size()&1){
			if(fa&&!del[fa])ans.push_back({d.back(),fa}),del[fa]=1;
		}
	}
}
inline void solve(){
	for(int i=1;i<=tot;i++)son[i].clear(),vst[i]=del[i]=0;
	ans.clear(),A.clear(),B.clear();
	cin>>n,tot=n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(A.find(a[i]+i)==A.end())A[a[i]+i]=++tot;
		if(B.find(a[i]-i)==B.end())B[a[i]-i]=++tot;
		son[i].push_back({A[a[i]+i]}),son[A[a[i]+i]].push_back(i);
		son[i].push_back({B[a[i]-i]}),son[B[a[i]-i]].push_back(i);
	}
	for(int i=1;i<=tot;i++){
		if(vst[i])continue;
		cnt=0,dfs(i,0);
		if(cnt&1)return cout<<"No\n",void();
	}
	cout<<"Yes\n";
	for(auto t:ans)cout<<t.first<<' '<<t.second<<endl;
}
signed main(){
	#ifndef ONLINE_JUDGE
	freopen(".in","r",stdin);
	#endif
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T;cin>>T;
	while(T--)solve();
	return 0;
}