#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
int a[MAXN], n;
vector<int> val1, val2;
vector<pair<int, int>> e[MAXN];
void add(int a, int b, int i) {
    e[a].push_back({b, i});
    e[b].push_back({a, i});
}
int u[MAXN], v[MAXN];
bool vis[MAXN];
bool used[MAXN];
vector<pair<int, int>> ans;
void dfs(int u, int pre) {
    vis[u] = 1;
    int lst = 0;
    for (auto p : e[u]) if (p.second != pre) {
        int v = p.first;
        int w = p.second;
        if (!vis[v]) dfs(v, w);
        if (!used[w]) {
            if (lst) {
                ans.push_back({lst, w});
                used[lst] = used[w] = 1;
                lst = 0;
            } else {
                lst = w;
            }
        }
    }
    if (lst && pre) {
        ans.push_back({lst, pre});
        used[lst] = used[pre] = 1;
    }
}
int T;
int main() {
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        if (n & 1) {
            printf("No\n");
            continue;
        }
        val1.clear(), val2.clear();
        ans.clear();
        for (int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
            val1.push_back({a[i] - i});
            val2.push_back({a[i] + i});
        }
        sort(val1.begin(), val1.end());
        sort(val2.begin(), val2.end());
        val1.erase(unique(val1.begin(), val1.end()), val1.end());
        val2.erase(unique(val2.begin(), val2.end()), val2.end());
        int m = val1.size() + val2.size();
        for (int i = 1; i <= n; i++) {
            used[i] = 0;
        }
        for (int i = 1; i <= m; i++) {
            vis[i] = 0;
            e[i].clear();
        }
        for (int i = 1; i <= n; i++) {
            int u = lower_bound(val1.begin(), val1.end(), a[i] - i) - val1.begin() + 1;
            int v = lower_bound(val2.begin(), val2.end(), a[i] + i) - val2.begin() + 1;
            v += val1.size();
            add(u, v, i);
        }
        for (int i = 1; i <= m; i++) if (!vis[i]) {
            dfs(i, 0);
        }
        if (ans.size() == n / 2) {
            printf("Yes\n");
            for (auto p : ans) {
                printf("%d %d\n", p.first, p.second);
            }
        } else {
            printf("No\n");
        }
    }
    return 0;
}

/*
6
14 22 33 11 25 36

*/