#include <bits/stdc++.h>
using namespace std;
const long long N = 2005;
long long n, idx, p[N], s[N], pos[N], sum;
vector<pair<long long, long long> > ans;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> p[i], p[i]--;
  for (long long i = 0; i < n; i++) cin >> s[i], s[i]--, pos[s[i]] = i;
  for (long long i = 0; i < n; i++) {
    for (long long j = i; j < n; j++)
      if (p[j] == s[i]) idx = j;
    for (long long j = idx - 1; j >= i; j--) {
      if (pos[p[j]] >= idx) {
        ans.push_back({idx + 1, j + 1});
        sum += idx - j;
        swap(p[idx], p[j]);
        idx = j;
      }
    }
  }
  cout << sum << "\n" << ans.size() << "\n";
  for (auto &ele : ans) cout << ele.first << " " << ele.second << "\n";
}
