#include<bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3fll
#define debug(x) cerr<<#x<<"="<<x<<endl
using namespace std;
using ll=long long;
using ld=long double;
using pli=pair<ll,int>;
using pi=pair<int,int>;
template<typename A>
using vc=vector<A>;
inline int read()
{
    int s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
inline ll lread()
{
    ll s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
template<const int N,const int M>
struct wgraph
{
    int head[N+5];
    int ww[M+5];
    int t[M+5];
    int x[M+5];
    int cntm;
    wgraph(){ cntm=1;}
    inline void clear(int n=N)
    {
        cntm=1;
        for(int i=1;i<=n;i++) head[i]=0;
    }
    inline void ad(int u,int v,int w)
    {
        cntm++;
        t[cntm]=v;
        x[cntm]=head[u];
        ww[cntm]=w;
        head[u]=cntm;
    }
    inline void add(int u,int v,int w)
    {
        // printf("add %d %d %d\n",u,v,w);
        ad(u,v,w);
        ad(v,u,w);
    }
    inline int st(int num){ return head[num];}
    inline int to(int num){ return t[num];}
    inline int nx(int num){ return x[num];}
    inline int w(int num){ return ww[num];}
};
wgraph<200000,200000>g;
map<int,int>id1;
map<int,int>id2;
bool dfn[200001];
bool vis[200001];
int a[100001];
vc<pi>ans;
int n,c;
inline void clear()
{
    memset(vis,0,sizeof(bool)*(n+1));
    memset(dfn,0,sizeof(bool)*(c+1));
    g.clear(c);
    id1.clear();
    id2.clear();
    ans.clear();
}
void dfs(int num,int faw)
{
    vc<int>son;dfn[num]=1;
    for(int i=g.st(num);i;i=g.nx(i))
    {
        int p=g.to(i);
        if(g.w(i)==faw) continue;
        if(!dfn[p]) dfs(p,g.w(i));
        if(!vis[g.w(i)]) son.push_back(g.w(i));
    }
    if(son.size()&1) son.push_back(faw);

    for(unsigned i=0;i<son.size();i+=2)
    {
        vis[son[i]]=vis[son[i+1]]=1;
        ans.push_back(pi(son[i],son[i+1]));
    }
}
inline void solve()
{
    clear();n=read(),c=0;
    for(int i=1;i<=n;i++)
    {
        a[i]=read();
        if(!id1.count(a[i]-i)) id1[a[i]-i]=++c;
        if(!id2.count(a[i]+i)) id2[a[i]+i]=++c;
        g.add(id1[a[i]-i],id2[a[i]+i],i);
    }
    for(int i=1;i<=c;i++) if(!dfn[i]) dfs(i,0);
    
    if((int)ans.size()!=n/2) printf("No\n");
    else
    {
        printf("Yes\n");
        for(auto i:ans) printf("%d %d\n",i.first,i.second);
    }
}
int main()
{
    int T=read();
    while(T--) solve();
    return 0;
}