#include <bits/stdc++.h>
using namespace std;
int a[32010];
vector<pair<int,int>> ans;
int main(){
	int n;
	cin >> n;
	for (int i = 1;i <= n;i++)	
		cin >> a[i];
	a[n + 1] = INT_MAX;
	while (!is_sorted(a + 1,a + n + 1))
		for (int i = 1;i < n;i++)
			if (a[i] > a[i + 1]){
				int j = i + 1;
				while (a[j] > a[j + 1])
					j++;
				reverse(a + i,a + j + 1);
				ans.emplace_back(i,j);
			}
	cout << ans.size() << endl;
	for (auto i : ans)
		cout << i.first << ' ' << i.second << endl;
	return 0;
}