#include <bits/stdc++.h>
using namespace std;
int m[2005], n[2005];
int a[2005 * 1000], b[2005 * 1000];
int x;
int c = 0;
int main() {
  int N;
  cin >> N;
  for (int i = 1; i <= N; i++) {
    cin >> m[i];
    ;
  }
  for (int i = 1; i <= N; i++) {
    cin >> n[i];
  }
  int sum = 0;
  for (int i = 1; i <= N; i++) {
    for (int j = 1; i <= N; j++) {
      if (m[i] == n[j]) {
        m[i] = j - i;
        sum += abs(j - i);
        break;
      }
    }
  }
  printf("%d\n", sum / 2);
  bool flag = true;
  int i, j;
  sum /= 2;
  while (sum) {
    i = 1, j = 1;
    for (i = 1; i <= N; i++) {
      if (m[i] < 0) break;
    }
    for (j = i - 1; j > 0; j--) {
      if (m[j]) break;
    }
    int temp = m[i];
    a[c] = i;
    b[c++] = j;
    m[i] = m[j] - abs(j - i);
    m[j] = temp + abs(j - i);
    sum -= abs(j - i);
  }
  printf("%d\n", c);
  for (int i = 0; i < c; i++) printf("%d %d\n", a[i], b[i]);
  return 0;
}
