#include <algorithm>
#include <iostream>
#include <vector>
#include <cstdio>

using namespace std;

struct node {
    long long index;
    long long element;

    node(long long i, long long e) {
        this->index = i;
        this->element = e;
    }
};

bool operator<(node a, node b) {
    return a.element < b.element;
}

vector<node> a;
vector<long long> a2;

void Sort(long long left, long long right, long long v) {
    if (left == right) {
        return;
    }
    long long mid = (left + right) / 2;
    Sort(left, mid, v);
    Sort(mid + 1, right, v);
    long long i = mid;
    long long l = mid, r = mid;
    while (i >= left && a2[i] > v) {
        l = i;
        i--;
    }
    long long j = mid + 1;
    while (j <= right && a2[j] <= v) {
        r = j;
        j++;
    }
    if (l != r) {
        printf("%lld %lld\n", l, r);
        reverse(a2.begin() + l, a2.begin() + r + 1);
    }
}

void Merge(long long left, long long right) {
    if (left == right) {
        return;
    }
    long long mid = (left + right) / 2;
    Sort(left, right, mid);
    Merge(left, mid);
    Merge(mid + 1, right);
}

inline int read() {
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = x * 10 + ch - 48;
        ch = getchar();
    }
    return x * f;
}


int main() {
    long long n = read();
    a.push_back(node(-1, -1));
    for (long long i = 1; i <= n; i++) {
        a.push_back(node(i, read()));
    }
    sort(a.begin() + 1, a.end());
    a2.resize(n + 1, -1);
    for (long long i = 1; i < a.size(); i++) {
        a2[a[i].index] = i;
    }
    Merge(1, n);
    printf("-1 -1\n");
    return 0;
}