#include<bits/stdc++.h>
#define cir(i,a,b) for(int i=a;i<b;++i)
using namespace std;
#define fcin cin
#define fcout cout
class tree{
private:
    vector<vector<pair<int,int>>> gr;
    vector<int> id;
    vector<int> sum,siz,vis;
    auto dfs(int u,int fr=-1)->void{
        sum[u]=siz[u];vis[u]=true;
        for(auto&[v,w]:gr[u]) if(!vis[v]){
            dfs(v,u);sum[u]+=(sum[v]-1);
            if(sum[v]&1) id[w]=u;
            else id[w]=v;
        }else if(v!=fr&&id[w]==-1){
            --sum[u];id[w]=v;
        }
    }
public:
    auto link(int u,int v,int w){
        gr[u].emplace_back(v,w);
        gr[v].emplace_back(u,w);
    }
    auto setsiz(vector<int> _siz){siz=_siz;}
    auto check(){
        cir(i,0,(int)(gr.size())) if(!vis[i]) dfs(i);
        return id;
    }
    tree(int _n,int _m):gr(_n),id(_m,-1),sum(_n),siz(_n),vis(_n){}
};
class dsu{
private:
    vector<int> f,siz;
public:
    auto findset(int u)->int{
        return f[u]==u?u:f[u]=findset(f[u]);
    }
    auto merge(int u,int v){
        u=findset(u);v=findset(v);
        if(u==v) return;
        f[u]=v;siz[v]+=siz[u];
    }
    auto size(auto u){return siz[findset(u)];}
    dsu(int _n):f(_n),siz(_n,1){iota(f.begin(),f.end(),0);}
};
int main(){
    ios::sync_with_stdio(false),fcin.tie(nullptr);
    int T;fcin>>T;
    while(T--) []{
        int n;fcin>>n;vector<int> a(n);
        for(auto&i:a) fcin>>i;
        map<int,vector<int>> ax,bx;
        cir(i,0,n) ax[a[i]-i].push_back(i);
        cir(i,0,n) bx[a[i]+i].push_back(i);
        vector<vector<int>> fr(n);
        dsu ds(n);
        auto cccnt=-1;
        vector<int> siz;
        for(auto&[a,b]:ax){
            ++cccnt;
            for(auto&i:b) fr[i].push_back(cccnt);
            cir(i,1,(int)(b.size())) ds.merge(b[i-1],b[i]);
            siz.push_back(b.size());
        }
        for(auto&[a,b]:bx){
            ++cccnt;
            for(auto&i:b) fr[i].push_back(cccnt);
            cir(i,1,(int)(b.size())) ds.merge(b[i-1],b[i]);
            siz.push_back(b.size());
        }
        auto vaild=true;
        cir(i,0,n) vaild&=(!(ds.size(i)&1));
        if(!vaild) return fcout<<"No"<<'\n',void();
        tree tr(cccnt+1,n);
        cir(i,0,n) tr.link(fr[i][0],fr[i][1],i);
        tr.setsiz(siz);
        const auto id=tr.check();
        map<int,vector<int>> idx;
        cir(i,0,n) idx[id[i]].push_back(i);
        fcout<<"Yes"<<'\n';
        for(auto&[a,b]:idx){
            for(auto i=0;i<(int)(b.size());i+=2) fcout<<b[i]+1<<' '<<b[i+1]+1<<'\n';
        }
    }();
    return 0;
}