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