#include <bits/stdc++.h>

struct Fenwick_Tree{
    std::vector<int> c;
    int n;
    Fenwick_Tree(int n) : n(n) {
        c.resize(n + 1);
    }
    void add(int x, int y) {
        for (int i = x; i <= n; i += i & -i) {
            c[i] += y;
        }
    }
    int query(int x) {
        int res = 0;
        for (int i = x; i > 0; i -= i & -i) {
            res += c[i];
        }
        return res;
    }

    int kth(int k) {
        int res = 0;
        for (int i = 1 << std::__lg(n); i > 0; i >>= 1) {
            if (res + i <= n && c[res + i] < k) {
                k -= c[res + i];
                res += i;
            }
        }
        return res + 1;
    }
};

using i64 = long long;

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int n;
    std::cin >> n;
    std::vector<int> a(n + 1);
    std::vector<int> ord(n + 1);

    for (int i = 1; i <= n; i += 1){
        std::cin >> a[i];
    }
    Fenwick_Tree tree(n);
    for (int i = n; i >= 0; i -= 1) {
        if (i && i == a[i]) continue;
        std::cout << i - 1 << " " << i - 1 << "\n";
        std::vector<int> ord(i + 1);
        for (int j = 1; j <= i; j += 1) {
            ord[j] = j;
        }
        std::sort(ord.begin() + 1, ord.end(), [&](int x, int y) {
            return a[x] > a[y];
        });
        for (int j = 2; j <= i; j += 1) {
            std::cout << ord[j] + tree.query(n - ord[j] + 1) << " " << 1 << "\n";
            tree.add(n - ord[j] + 1, 1);
        }
        break;
    }
    return 0; 
}