Problem: Anton loves transforming one permutation into another one by swapping elements for money, and Ira doesn't like paying for stupid games. Help them obtain the required permutation by paying as little money as possible.

More formally, we have two permutations, p and s of numbers from 1 to n. We can swap pi and pj, by paying |i - j| coins for it. Find and print the smallest number of coins required to obtain permutation s from permutation p. Also print the sequence of swap operations at which we obtain a solution. 

Input

The first line contains a single number n (1 ≤ n ≤ 2000) — the length of the permutations.

The second line contains a sequence of n numbers from 1 to n — permutation p. Each number from 1 to n occurs exactly once in this line.

The third line contains a sequence of n numbers from 1 to n — permutation s. Each number from 1 to n occurs once in this line.

Output

In the first line print the minimum number of coins that you need to spend to transform permutation p into permutation s.

In the second line print number k (0 ≤ k ≤ 2·106) — the number of operations needed to get the solution.

In the next k lines print the operations. Each line must contain two numbers i and j (1 ≤ i, j ≤ n, i ≠ j), which means that you need to swap pi and pj.

It is guaranteed that the solution exists.

Examples

Input

4
4 2 1 3
3 2 4 1


Output

3
2
4 3
3 1

Note

In the first sample test we swap numbers on positions 3 and 4 and permutation p becomes 4 2 3 1. We pay |3 - 4| = 1 coins for that. On second turn we swap numbers on positions 1 and 3 and get permutation 3241 equal to s. We pay |3 - 1| = 2 coins for that. In total we pay three coins.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2010, maxs = 2000001, mod = 1000000007;
int n, f[maxn], g[maxn], seg[maxn << 1], sum, tot, ans[maxs][2];
inline int idx(int L, int R) { return L + R | L != R; }
void init(int L, int R) {
  int o = idx(L, R);
  if (L == R) {
    seg[o] = f[L];
    return;
  }
  int M = L + R >> 1, lch = idx(L, M), rch = idx(M + 1, R);
  init(L, M);
  init(M + 1, R);
  seg[o] = min(seg[lch], seg[rch]);
}
void upd(int L, int R, int x, int v) {
  int o = idx(L, R);
  if (L == R) {
    seg[o] = v;
    return;
  }
  int M = L + R >> 1, lch = idx(L, M), rch = idx(M + 1, R);
  if (x <= M)
    upd(L, M, x, v);
  else
    upd(M + 1, R, x, v);
  seg[o] = min(seg[lch], seg[rch]);
}
int que(int L, int R, int l, int r) {
  int o = idx(L, R);
  if (l <= L && R <= r) return seg[o];
  int M = L + R >> 1, ret = n;
  if (l <= M) ret = min(ret, que(L, M, l, r));
  if (r > M) ret = min(ret, que(M + 1, R, l, r));
  return ret;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", f + i);
  for (int i = 1; i <= n; ++i) {
    int x;
    scanf("%d", &x);
    g[x] = i;
  }
  for (int i = 1; i <= n; ++i) f[i] = g[f[i]];
  for (int i = 1; i <= n; ++i) g[f[i]] = i;
  init(1, n);
  for (int i = n; i >= 1; --i) {
    int j = g[i];
    sum += i - g[i];
    while (j != i) {
      int k = g[que(1, n, j + 1, i)];
      swap(f[j], f[k]);
      swap(g[f[j]], g[f[k]]);
      upd(1, n, j, f[j]);
      upd(1, n, k, f[k]);
      ans[tot][0] = j;
      ans[tot++][1] = k;
      j = k;
    }
  }
  printf("%d\n%d\n", sum, tot);
  for (int i = 0; i < tot; ++i) printf("%d %d\n", ans[i][0], ans[i][1]);
  return 0;
}