#include <bits/stdc++.h>
using namespace std;
int N;
int P[2020], Q[2020], R[2020];
vector<pair<int, int>> ret;
int C;
void solve() {
  int i, j, k, l, r, x, y;
  string s;
  cin >> N;
  for (i = 0; i < N; i++) cin >> P[i];
  for (i = 0; i < N; i++) cin >> Q[i], R[Q[i]] = i;
  for (i = 0; i < N; i++) P[i] = R[P[i]];
  int cur;
  while (N) {
    for (cur = 0; cur < N; cur++)
      if (P[cur] == N - 1) break;
    while (cur < N - 1) {
      for (x = cur + 1; x <= N - 1; x++) {
        if ((P[x] < x && P[x] <= cur) || x == N - 1) {
          C += x - cur;
          ret.push_back({x + 1, cur + 1});
          swap(P[x], P[cur]);
          cur = x;
        }
      }
    }
    assert(P[N - 1] == N - 1);
    N--;
  }
  (void)printf("%d\n", C);
  (void)printf("%d\n", ret.size());
  for (auto& r : ret) (void)printf("%d %d\n", r.first, r.second);
}
int main(int argc, char** argv) {
  string s;
  int i;
  if (argc == 1) ios::sync_with_stdio(false);
  for (i = 0; i < argc - 1; i++) s += argv[i + 1], s += '\n';
  for (i = 0; i < s.size(); i++) ungetc(s[s.size() - 1 - i], stdin);
  solve();
  return 0;
}
