#include <cstdio>
#include <utility>
#include <iostream>

using namespace std;

int N;

int a[1 << 19];
int b[1 << 19];
int cd[1 << 19];
int pos[1 << 19];
pair < int, int > ans[1 << 19];
int sz = 0;

void scan(){
    scanf ( "%d", &N );

    for ( int i = 1; i <= N; ++i )
        scanf ( "%d", b + i );
    for ( int i = 1; i <= N; ++i )
        scanf ( "%d", a + i );
}

void solve(){
    for ( int i = 1; i <= N; ++i )
        cd[ a[i] ] = i;

    for ( int i = 1; i <= N; ++i ){
        a[i] = cd[ a[i] ];
        b[i] = cd[ b[i] ];
    }

    for ( int i = 1; i <= N; ++i )
        pos[ b[i] ] = i;

    for ( int i = 1; i <= N; ++i )
        if ( pos[i] != i ){
            pos [ b[i] ] = pos[i];
            swap ( b[i], b[ pos[i] ] );
          //  cout << i << " " << pos[i] << " " << b[i] << endl;

            ans[sz++] = make_pair ( pos[i], i );
            if ( pos[i] - i > 2 ){
                ans[sz++] = make_pair ( i + 1, pos[i] - 1 );
            }

            pos[i] = i;
        }

    printf ( "%d\n", sz  );

    for ( int i = 0; i < sz; ++i )
        printf ( "%d %d\n", ans[i].first, ans[i].second );
}
int main(){
    scan();
    solve();
}
