#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

int n;
int a[100020];
int b[100020];
int c[100020][2];
int p[100020];
int nn[100020];

int main()
{
    int i, j, k;
    int l, r;
    int pr, cr;

    scanf( "%d", &n );
    for ( i = 1; i <= n; i++ )
        scanf( "%d", &a[i] );

    for ( i = 1; i <= n; i++ )
        scanf( "%d", &b[i] );

    for ( i = 1; i <= n; i++ )
    {
        nn[b[i]] = i;
    }
    pr = 0; cr = 1;
    for ( i = 1; i <= n; i++ )
    {
        c[i][pr] = nn[a[i]];
        p[c[i][pr]] = i;
    }

    printf( "%d\n", n-1 );
    for ( i = 1; i < n; i++ )
    {
        l = min( i, p[i] );
        r = max( i, p[i] );
        printf( "%d %d\n", l, r );
        for ( j = l; j <= r; j++ )
        {
            c[j][cr] = c[r-(j-l)][pr];
        }
        for ( j = 1; j < l; j++ )
            c[j][cr] = c[j][pr];
        for ( j = r+1; j <= n; j++ )
            c[j][cr] = c[j][pr];

        for ( j = 1; j <= n; j++ )
        {
            p[c[j][cr]] = j;
        }
        swap( pr, cr );
    }
    return 0;
}
