https://atcoder.jp/contests/abc255/tasks/abc255_f

// compile: g++ -o data data.cpp -O3 -std=gnu++20 -Wall -Wextra -Wshadow -D_GLIBCXX_ASSERTIONS -ggdb3 -fmax-errors=2 -DLOCAL
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) {_variables(#x);_print(x);}
#else
#define debug(x...)
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define INTMAX (int)(9223372036854775807)
#define INTINF (int)(1152921504606846976)
#define int long long
#define MAXN 200010

int n;
int P[MAXN], I[MAXN], L[MAXN], R[MAXN];
int *pos[MAXN];
bool valid = 1;

int build(int *pl, int *pr, int *il, int *ir) {
    if (pl > pr || il > ir) return -1;
    int root = *pl;
    int *mid = pos[root];
    if (mid > ir || mid < il) {
        valid = 0;
        return -1;
    }
    int sz = mid - il;
    L[root] = build(pl+1, pl+sz, il, mid - 1);
    R[root] = build(pl+sz+1, pr, mid + 1, ir);
    return root;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    cin >> n;
    rep(i, 0, n) cin >> P[i], --P[i];
    rep(i, 0, n) cin >> I[i], --I[i];
    memset(pos, 0, sizeof(pos));
    rep(i, 0, n) pos[I[i]] = I + i;
    int root = build(P, P+n-1, I, I+n-1);
    if (!valid || root) {
        cout << -1 << endl;
        return 0;
    }
    rep(i, 0, n) cout << L[i]+1 << " " << R[i]+1 << endl;

    return 0;
}