CF C

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int,int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvl(vector <ll> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}


void cvv(vector <vector <int> > &v){
    for (auto x: v) cv(x);
    cout<<"\n";
}

void cvb(vector <bool> v){
    for (bool x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvs(vector <string>  v){
    for (auto a: v){
        cout<<a<<"\n";
    }
}

void cvp(vector <pii> a){
    for (auto p: a){
        cout<<p.first+1<<' '<<p.second+1<<"\n";
    }
    //cout<<"\n";
}
int t=1,n;
bool sh=0;
vector <pii> ans;
bool gr(vector <int> a){
    for (int i = 1; i < a.size();++i){
        if (a[i] < a[i-1]) return 0;
    }
    return 1;
}

void left(vector <int> &a){
    for (int i = n - 1; i >= 1; --i){
        if ((a[i] + a[i - 1]) % 2 == 0){
            a[i - 1] = a[i];
            ans.push_back({i-1,i});
        }
    }
}

void right(vector <int> &a){
    for (int i = 0; i < n - 1; ++i){
        if ((a[i] + a[i+1]) % 2 == 1){
            a[i + 1] = a[i];
            ans.push_back({i,i+1});
        }
    }
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    if (!sh) cin>>t;

    for (int go = 0; go < t; ++go){
        cin>>n;
        ans.clear();
        vector <int> a(n); for (int &i: a) cin>>i;

        while (!gr(a)){
            left(a);
            right(a);
        }
        cout<<ans.size()<<"\n";
        cvp(ans);
    }
}