#include <bits/stdc++.h>
using namespace std;
const int maxn = 300 + 10;
int n, a[maxn], b[maxn];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d", a + i);
  for (int i = 0; i < n; ++i) scanf("%d", b + i);
  vector<int> seq;
  for (int i = 0; i < n; ++i)
    if (b[i] != a[i]) {
      for (int j = i + 1; j < n; ++j)
        if (b[j] == a[i]) {
          for (int k = j; k > i; --k) {
            seq.push_back(k);
            swap(b[k], b[k - 1]);
          }
          break;
        }
    }
  printf("%d\n", (int)seq.size());
  for (int i = 0; i < seq.size(); ++i) printf("%d %d\n", seq[i], seq[i] + 1);
  return 0;
}
