#include <iostream>
#include <vector>
#include <queue>
using namespace std;

int main() {
    int t;
    cin >> t;
    while (t--) {
        int n, time = 0;
        cin >> n;
        int a[n], b[n], c[3] = {0};
        vector<pair<int, int>> swaps;
        for(int i = 0; i < 3; i++) {
            c[i] = 0;
        }
        for (int i = 0; i < n; i++) {
            cin >> a[i];
            if (a[i] < 3) {
                c[a[i]]++;
            }
        }
        for(int i = 0; i < c[0]; i++) {
            b[i] = 0;
        }
        for(int i = c[0]; i < c[0] + c[1]; i++) {
            b[i] = 1;
        }
        for(int i = c[0] + c[1]; i < n; i++) {
            b[i] = 2;
        }
        for(int i = n - 1; i >= 0; i--) {
            if(a[i] != b[i]) {
                if(abs(a[i] - b[i]) == 1) {
                    for(int j = n - 1; j >= 0; j--) {
                        if(a[j] == b[i]&&j<i) {
                            swap(a[i], a[j]);
                            swaps.push_back({i+1, j+1});
                            time++;
                            break;
                        }
                        else if(a[j] == b[i]&&b[j]!=b[i]){
                        	swap(a[i], a[j]);
                            swaps.push_back({i+1, j+1});
                            time++;
                            break;
                        }
                    }
                } else {
                    int m;
                    for(int j = n - 1; j >= 0; j--) {
                        if(a[j] == 1&&j<i) {
                            swap(a[i], a[j]);
                            swaps.push_back({i+1, j+1});
                            time++;
                            break;
                        }
                        else if(a[j] == 1&&b[j]!=b[i]){
                        	swap(a[i], a[j]);
                            swaps.push_back({i+1, j+1});
                            time++;
                            break;
                        }
                    }
                    for(int j = m; j >= 0; j--) {
                        if(a[j] == b[i]&&j<i) {
                            swap(a[i], a[j]);
                            swaps.push_back({i+1, j+1});
                            time++;
                            break;
                        }
                        else if(a[j] == b[i]&&b[j]!=b[i]){
                        	swap(a[i], a[j]);
                            swaps.push_back({i+1, j+1});
                            time++;
                            break;
                        }
                    }
                }
            }
        }
        cout << time << endl;
        for (auto &p : swaps) {
            cout << p.first << " " << p.second << endl;
        }
        for(int i = 0; i< n;i++){
        	cout<<a[i]<<" ";
        }
        cout<<endl;
    }   
}