#include <bits/stdc++.h>
using std::bitset;
using std::cout;
using std::deque;
using std::endl;
using std::greater;
using std::lower_bound;
using std::make_pair;
using std::map;
using std::max;
using std::min;
using std::multimap;
using std::multiset;
using std::nth_element;
using std::pair;
using std::priority_queue;
using std::queue;
using std::reverse; 
using std::set;
using std::sort;
using std::sqrt;
using std::stable_sort;
using std::string;
using std::swap;
using std::unique;
using std::upper_bound;
using std::vector;
typedef long long li;
typedef long double lf; 

inline li read(){
	li ans = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9'){
		f = (ch == '-') ? -1 : 1;
		ch = getchar();
	}
	while(ch <= '9' && ch >= '0'){
		ans = ans * 10 + (ch ^ 48);
		ch = getchar();
	}
	return ans * f;
}

li p[2], n, a[200010];
struct edge{
    li to, next, id;
} e[400010];
vector<pair<li, li>> ans;
li lenedge = 1, head[200010], vis[200010];
void addedge(li u, li v, li id){
    // cout << u << " " << v << endl;
    e[++lenedge] = {v, head[u], id};
    head[u] = lenedge;
}
map<li, li> mp[2];

li getid(li x, li op){
    if(!mp[op][x]) mp[op][x] = ++p[op];
    return mp[op][x];
}

li visp[200010], fl;
li cnt;
li istree[200010];

void dfs1(li u){
    visp[u] = 1;
    for(li i = head[u]; i; i = e[i].next){
        cnt++;
        li v = e[i].to;
        // cout << "find " << u << " " << v << endl;
        if(!visp[v]){
            dfs1(v);
            istree[i >> 1] = 1;
            // cout << "tree is " << u << " " << v << " " << e[i].id << endl;
        }
    }
}

void dfs2(li u, li fa){
    vector<li> x;
    for(li i = head[u]; i; i = e[i].next){
        if((i ^ 1) == fa) continue;
        if(vis[e[i].id]) continue;
        if(istree[i >> 1]){
            dfs2(e[i].to, i);
        }
    }
    for(li i = head[u]; i; i = e[i].next){
        if((i ^ 1) == fa) continue;
        // cout << "vis " << e[i].id << " " << vis[e[i].id] << endl;
        if(vis[e[i].id]) continue;
        // cout << u << " " << e[i].to << endl;
        // if((i ^ 1) == fa) continue;
        x.push_back(e[i].id);
        // cout << "in " << e[i].id << endl;
    }
    while(x.size() > 1){
        li a = x.back(); x.pop_back();
        li b = x.back(); x.pop_back();
        // cout << "link1 " << a << " " << b << endl;
        ans.push_back({a, b});
        vis[a] = vis[b] = 1;
    }
    if(x.size()){
        li a = x.back(); x.pop_back();
        li b = e[fa ^ 1].id;
        vis[a] = vis[b] = 1;
        // cout << "link2 " << a << " " << b << endl;
        ans.push_back({a, b});
    }
}

int main(){
    // freopen("wonderful.ans", "r", stdin);
    // freopen("www.ww", "w", stdout);
    li T = read();
    while(T--){
        fl = 1;
        ans.clear();
        n = read();
        mp[0].clear(), mp[1].clear();
        for(li i = 1; i <= n; i++) a[i] = read();
        memset(head, 0, sizeof head);
        memset(vis, 0, sizeof vis);
        memset(visp, 0, sizeof visp);
        memset(istree, 0, sizeof istree);
        p[0] = p[1] = 0;
        lenedge = 1;
        for(li i = 1; i <= n; i++){
            getid(a[i] - i, 0), getid(a[i] + i, 1);
        }
        for(li i = 1; i <= n; i++){
            li idx = getid(a[i] - i, 0), idy = getid(a[i] + i, 1) + p[0];
            addedge(idx, idy, i), addedge(idy, idx, i);
        }
        // cout << p[0] << " " << p[1] << endl;
        for(li i = 1; i <= p[0] + p[1] && fl; i++){
            if(visp[i]) continue;
            // cout << "i = " << i << endl;
            // cout << "vis 5 = " << vis[5] << endl;
            dfs1(i);
            // cout << "sb" << endl;
            cnt /= 2;
            // cout << "cnt = " << cnt << endl;
            if(cnt % 2 == 1) fl = 0;
            cnt = 0;
            if(fl){
                dfs2(i, 0);
            }
        }
        if(!fl){
            printf("No\n");
        } else{
            printf("Yes\n");
            for(auto v : ans) printf("%lld %lld\n", v.first, v.second);
        }
    }
    return 0;
}