#include<bits/stdc++.h>
using namespace std;

#define pii pair<int,int>
#define fi first
#define se second

const int maxn=4e5+5;

int n,m,cnt;
int a[maxn];

bool flg;
bool vis[maxn],blk[maxn];

map<int,int>mp[2];

vector<pii>E[maxn];

pii cho[maxn];

inline void clr()
{
    memset(cho,0,sizeof(cho));
    memset(vis,0,sizeof(vis));
    memset(blk,0,sizeof(blk));
    memset(a,0,sizeof(a));
    for(int i=1;i<=m;i++) E[i].clear();
    mp[0].clear();mp[1].clear();
    m=n=cnt=flg=0;
}
inline void sayno()
{
    puts("No");
    flg=1;
    return ;
}

inline void dfs(int u,int id)
{
    vis[u]=1;
    for(auto v:E[u])
    {
        if(!vis[v.fi])
        {
            dfs(v.fi,v.se);
            if(flg) return ;
        }
    }
    vector<int>tmp;
    tmp.clear();
    for(auto v:E[u])
    {
        if(!blk[v.se]&&v.se!=id)
        {
            tmp.push_back(v.se);
        }
    }
    if(tmp.size()&1)
    {
        if(id==0) sayno();
        tmp.push_back(id);
    }
    for(int i=0;i<tmp.size();i+=2) cho[++cnt]={tmp[i],tmp[i+1]},blk[tmp[i]]=blk[tmp[i+1]]=1;
}

int main()
{
    // freopen("matching1.in","r",stdin);
    // freopen("matching.out","w",stdout);
    int _;
    scanf("%d",&_);
    while(_--)
    {
        clr();
        scanf("%d",&n);
        for(int i=1;i<=n;i++) scanf("%d",&a[i]),mp[0][a[i]-i]=1,mp[1][a[i]+i]=1;
        for(int i=0;i<=1;i++)
        {
            auto it1=mp[i].begin(),it2=mp[i].begin();
            for(it2++;it2!=mp[i].end();it1++,it2++) it2->second+=it1->second;
            for(it1=mp[i].begin();it1!=mp[i].end();it1++) it1->second+=m;
            it1--;
            m=it1->second;
        }
        for(int i=1;i<=n;i++)
        {
            E[mp[0][a[i]-i]].push_back({mp[1][a[i]+i],i});
            E[mp[1][a[i]+i]].push_back({mp[0][a[i]-i],i});
            // printf("%d %d\n", mp[0][a[i]-i],mp[1][a[i]+i]);
        }
        for(int i=1;i<=m;i++)
        {
            if(!vis[i]) dfs(i,0);
            if(flg) break;
        }
        if(flg) continue;
        if(cnt!=n/2) sayno();
        if(flg) continue;
        puts("Yes");
        for(int i=1;i<=cnt;i++) printf("%d %d\n",cho[i].fi,cho[i].se);
    }
}