#include <bits/stdc++.h>
using namespace std;
int n;
int p[2011];
int cha[2010];
int abs(int a) {
  if (a < 0) return -a;
  return a;
}
int sol[3000100][2];
int kk = 0;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &p[i]);
  }
  int tt;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &tt);
    cha[tt] = i;
  }
  for (int i = 1; i <= n; i++) {
    p[i] = cha[p[i]];
  }
  long long sl = 0;
  for (int i = 1; i <= n; i++) {
    int curr;
    for (int j = 1; j <= n; j++) {
      if (p[j] == i) {
        curr = j;
        break;
      }
    }
    if (curr == i) continue;
    for (int j = curr - 1; j >= i; j--) {
      if (p[j] >= curr) {
        sl += abs(curr - j);
        sol[kk][0] = curr;
        sol[kk][1] = j;
        kk++;
        p[curr] = p[j];
        p[j] = i;
        curr = j;
      }
    }
  }
  printf("%d\n", sl);
  printf("%d\n", kk);
  for (int i = 0; i < kk; i++) {
    printf("%d %d\n", sol[i][0], sol[i][1]);
  }
}
