#include <bits/stdc++.h>
using namespace std;
int n, S, x;
vector<int> a, b;
vector<pair<int, int> > ans;
int main() {
  scanf("%d", &n);
  a.resize(n, 0);
  b.resize(n, 0);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
    a[i]--;
  }
  for (int i = 0; i < n; ++i) {
    scanf("%d", &x);
    --x;
    b[x] = i;
  }
  for (int i = 0; i < n; ++i) a[i] = b[a[i]];
  b.clear();
  for (int i = 0; i < n; ++i) {
    if (a[i] != i) {
      int s = i;
      b.push_back(i);
      for (int j = i + 1; j < n; ++j) {
        if (a[j] == i) {
          b.push_back(j);
          break;
        }
        if (a[j] > a[s]) {
          b.push_back(j);
          s = j;
        }
      }
      for (int j = b.size() - 1; j > 0; --j) {
        ans.push_back(make_pair(b[j], b[j - 1]));
        swap(a[b[j]], a[b[j - 1]]);
        S += abs(b[j] - b[j - 1]);
      }
      b.clear();
    }
  }
  cout << S << endl << ans.size() << endl;
  for (int i = 0; i < ans.size(); ++i) {
    printf("%d %d\n", ans[i].first + 1, ans[i].second + 1);
  }
  return 0;
}
