#include <bits/stdc++.h>
using namespace std;
int t, n, m, u, v, q, r, ql, qr, k, l, s, w, h, c, z, d, a, b;
const int N = 2e3 + 50;
const long long mod = 1e9 + 7;
const long long INF = 1LL << 52LL;
int P[N], S[N];
bool vis[N];
vector<pair<int, int> > moves;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int norm[N];
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> P[i];
  for (int i = 1; i <= n; ++i) cin >> S[i];
  for (int i = 1; i <= n; ++i) {
    norm[S[i]] = i;
  }
  for (int i = 1; i <= n; ++i) {
    P[i] = norm[P[i]];
  }
  long long cost = 0;
  for (int i = 1; i <= n; ++i) {
    if (P[i] == i) continue;
    int j;
    for (j = i + 1; j <= n; ++j)
      if (P[j] == i) break;
    for (int k = j - 1; k >= i; --k) {
      if (P[k] >= j) {
        moves.push_back(make_pair(k, j));
        swap(P[k], P[j]);
        cost += abs(k - j);
        j = k;
      }
    }
  }
  cout << cost << '\n';
  cout << moves.size() << '\n';
  for (int i = 0; i < moves.size(); ++i) {
    cout << moves[i].first << " " << moves[i].second << '\n';
  }
  return 0;
}
