#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void write(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const ll N=1e6+9;
ll T,n,a[N],tot,dep[N];
vector<pii>to[N],ans;
map<ll,ll>mp1,mp2;
ll dfs(ll x,ll f){
    dep[x]=dep[f]+1;
    vector<ll>e;
    for(pii es:to[x]){
        ll y=es.first,id=es.second;
        if(!dep[y]){
            ll ret=dfs(y,x);
            if(ret)ans.push_back(make_pair(ret,id));
            else e.push_back(id);
        }
        else if(dep[y]>dep[x])e.push_back(id);
    }
    rep(i,0,(ll)e.size()-2){
        ans.push_back(make_pair(e[i],e[i+1]));
        i++;
    }
    if((ll)e.size()&1)return e.back();
    return 0;
}
void solve(){
    n=read();
    rep(i,1,n)a[i]=read();
    tot=0;
    rep(i,1,n){
        if(!mp1.count(a[i]-i))mp1[a[i]-i]=++tot;
        if(!mp2.count(a[i]+i))mp2[a[i]+i]=++tot;
    }
    rep(i,0,tot+1)to[i].clear();
    rep(i,1,n){
        to[mp1[a[i]-i]].push_back(make_pair(mp2[a[i]+i],i));
        to[mp2[a[i]+i]].push_back(make_pair(mp1[a[i]-i],i));
    }
    rep(i,0,tot+1)dep[i]=0;
    ans.clear();
    rep(i,1,tot){
        if(!dep[i])dfs(i,0);
    }
    if((ll)ans.size()!=n/2)return puts("No"),void();
    puts("Yes");
    for(pii p:ans)write(p.first),putchar(' '),write(p.second),putchar('\n');
}
bool Med;
int main(){
    cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
    T=read();
    while(T--)solve();
    return 0;
}