#include <bits/stdc++.h>
using namespace std;
int main() {
  int tt = 120;
  int test[6] = {0, 1, 3, 5, 2, 4};
  int n = 5;
  int p[2001], s[2001];
  int p_l[2001], s_l[2001];
  int ans = 0;
  vector<pair<int, int> > v_ans;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &p[i]);
    p_l[p[i]] = i;
  }
  for (int i = 1; i <= n; i++) s[i] = i;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &s[i]);
    s_l[s[i]] = i;
  }
  for (int i = 1; i <= n; i++) {
    if (p[i] != s[i]) {
      int r = p_l[s[i]];
      for (int j = i; j <= r; j++) {
        int pos_j = s_l[p[j]];
        int pos_r = s_l[p[r]];
        if ((pos_j >= r && pos_r <= j && pos_j != pos_r)) {
          ans += abs(j - r);
          v_ans.push_back(make_pair(j, r));
          swap(p[j], p[r]);
          swap(p_l[p[j]], p_l[p[r]]);
          r = j;
          j = i - 1;
        }
      }
    }
  }
  printf("%d\n%d\n", ans, v_ans.size());
  for (int i = 0; i < v_ans.size(); i++)
    printf("%d %d\n", v_ans[i].first, v_ans[i].second);
  return 0;
}
