#include <bits/stdc++.h>
using namespace std;
long long rdtsc() {
  long long tmp;
  asm("rdtsc" : "=A"(tmp));
  return tmp;
}
inline int myrand() { return abs((rand() << 15) ^ rand()); }
inline int rnd(int x) { return myrand() % x; }
const int INF = (int)1.01e9;
const long double EPS = 1e-9;
void precalc() {}
const int maxn = (int)2e3 + 10;
int a[maxn], want[maxn];
int n;
bool read() {
  if (scanf("%d", &n) < 1) {
    return 0;
  }
  for (int i = 0; i < n; ++i) {
    scanf("%d", a + i);
    --a[i];
  }
  for (int i = 0; i < n; ++i) {
    int x;
    scanf("%d", &x);
    --x;
    want[x] = i;
  }
  return 1;
}
int st[maxn];
void solve() {
  int res = 0;
  int cnt = 0;
  vector<pair<int, int> > ans;
  for (int pos = 0; pos < n; ++pos) {
    if (want[a[pos]] == pos) {
      continue;
    }
    if (want[a[pos]] > pos) {
      st[cnt++] = pos;
      continue;
    }
    int i = cnt - 1;
    int was = a[pos];
    int last = pos;
    while (i >= 0 && want[was] < last) {
      ans.push_back(make_pair(st[i], last));
      res += (last - st[i]);
      swap(a[st[i]], a[last]);
      swap(st[i], last);
      --i;
    }
    assert(a[last] == was && want[was] == last);
    int cnt0 = cnt;
    cnt = i + 1;
    for (++i; i < cnt0; ++i) {
      assert(want[a[st[i]]] >= st[i]);
      if (want[a[st[i]]] > st[i]) {
        st[cnt++] = st[i];
      }
    }
  }
  assert(!cnt);
  printf("%d\n", res);
  printf("%d\n", ((int)(ans).size()));
  for (int i = 0; i < ((int)(ans).size()); ++i) {
    printf("%d %d\n", ans[i].first + 1, ans[i].second + 1);
  }
}
int main() {
  srand(rdtsc());
  precalc();
  while (1) {
    if (!read()) {
      break;
    }
    solve();
  }
  return 0;
}
