#include<iostream>
#include<string>
#include<algorithm>
#include<cctype>
#include<set>
#include<bitset>
#include<math.h>
#include<map>
#include<queue>
#include<iomanip>
using namespace std;
using ll = long long;

int main()
{
    int n, cnt = 0;
    cin >> n;
    vector<int> v(n);
    vector<vector<int>> ch;
    for (int i = 0; i < n; i++) cin >> v[i];
    for (int i = 0; i < n - 2; i++){
        for (int j = i; j < n-2; j++){
            if ((v[j] != v[j+1]) && (v[j] != v[j+2]) && (v[j+1] != v[j+2])){
                if (v[j+1] == max({v[j], v[j+1], v[j+2]})) {
                    swap(v[j+1], v[j+2]);
                    ch.push_back({j+1, j+2});
                    cnt++;
                    if (v[j] > v[j+1]){
                        swap(v[j], v[j+1]);
                        ch.push_back({j, j+1});
                        cnt++;
                    }
                else if ((v[j+1] == min({v[j], v[j+1], v[j+2]}))){
                    swap(v[j], v[j+1]);
                    ch.push_back({j, j+1});
                    cnt++;
                    if (v[j+1] > v[j+2]){
                        swap(v[j+1], v[j+2]);
                        ch.push_back({j+1, j+2});
                        cnt++;
                    }
                }
                }
            }
        }
    }
    cout << cnt << endl;
    for (auto x : ch){
        for (auto y1 : x){
            cout << y1 << " ";
        }
        cout << endl;
    }
    cin >> cnt;
}