#include <bits/stdc++.h>
using namespace std;
const int N = 32500;
int n, a[N];
bool ok(){
    for(int i = 2;i <= n;i++) if(a[i] < a[i - 1]) return 0;
    return 1;
}
vector<pair<int, int>> ans;
int main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n;
    for(int i = 1;i <= n;i++) cin >> a[i];
    while(!ok()){
        for(int l = 1, r;l < n;l = r + 1){
            r = l;
            while(a[r + 1] <= a[r] && r < n) r++;
            if(l < r){
                ans.push_back({l, r}); 
                reverse(a + l, a + r + 1);
            }
        }
    }
    cout << (int)ans.size() << endl;
    for(pair<int, int> op : ans)
        cout << op.first << " " << op.second << endl;
    return 0;
}