#include <bits/stdc++.h>
#include <bits/extc++.h>
#define inf (0x7f7f7f7f)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;
using namespace std;
template <class T>
inline void read(T &x){
    int ch = 0, f = 0; x = 0;
    for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = 1;
    for(; isdigit(ch); ch = getchar()) x = x * 10 + ch - 48;
    if(f) x = -x;
} 
using namespace __gnu_pbds;
template <class T>
using Oset = tree<T, null_type, less<T>, rb_tree_tag,
    tree_order_statistics_node_update>;

int main(){
    int n; read(n);
    vector<ll> pos(n + 1);
    Oset<ll> S;
    for(int i = 1, x; i <= n; i++){
        read(x);
        S.insert(pos[x] = 1ll * i * n);
    }
    ll cost = 0; vector<pair<int, int> > vec;
    for(int i = n - 1; i >= 1; i--) if(pos[i] > pos[i+1]){
        int rkx = (int) S.order_of_key(pos[i]) + 1;
        int rky = (int) S.order_of_key(pos[i+1]) + 1;
        cost += rky;
        vec.push_back({rkx, rky});
        S.erase(pos[i]);
        S.insert(pos[i] = pos[i+1] - 1);
    }
    printf("%lld %d\n", cost, (int) vec.size());
    for(auto [x, y] : vec) printf("%d %d\n", x, y);
    return 0;
}