#define pragma

#ifdef pragma
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif // pragma

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define all(x) begin(x), end(x)
#define pb push_back
#define x first
#define y second
#define int long long
#define zero(two) memset(two, 0, sizeof(two))

using namespace std;
using namespace __gnu_pbds;


typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef long double ld;
typedef vector<vi> matrix;
template<typename T>
using kawaii_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ld PI = atan2(0, -1);

void seriy() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(10);
    #if _offline
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
}

const int MAXN = 1e5 + 10;
const int INF = 1e18 + 7;
const int MAXLOG = 20;
const int MOD = 998244353;
const int BASE = 47;

signed main() {
    seriy();
    int n;
    cin >> n;
    vi a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        a[i]--;
    }
    vector<pii> kek;
    for(int i = 0; i < n; i++) {
        if(i < n / 2) {
            while(a[i] >= n / 2) {
                kek.pb({a[i], i});
                swap(a[a[i]], a[i]);
            }
        }
        else {
            while(a[i] < n / 2) {
                kek.pb({a[i], i});
                swap(a[a[i]], a[i]);
            }
        }
    }
    for(int i = 0; i < n; i++) {
        int cur = i, need = a[i];
        if(cur != need) {
            if(i < n / 2) {
                kek.pb({i, n - 1});
                kek.pb({a[i], n - 1});
                kek.pb({i, n - 1});
                swap(a[cur], a[need]);
            }
            else {
                kek.pb({i, 0});
                kek.pb({a[i], 0});
                kek.pb({i, 0});
                swap(a[cur], a[need]);
            }
        }
    }
    cout << kek.size() << '\n';
    for(auto i : kek) {
        cout << i.x + 1 << " " << i.y + 1 << '\n';
    }
    return 0;
}