#include #include using namespace std; #define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++) #define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define el '\n' #define spa " " #define Yes cout << "Yes" << el #define No cout << "No" << el #define YES cout << "YES" << el #define NO cout << "NO" << el #define inp(x) for(auto &i:x)cin>>i #define eps (1e-10) #define Equals(a,b) (fabs((a) - (b)) < eps ) #define debug(x) cerr << #x << " = " << x << el using ll = long long; using ull = unsigned long long; using i128 = __int128_t; using boost::multiprecision::cpp_int; using pii = pair; using pll = pair; using vi = vector; using vl = vector; using vvl = vector>; using vs = vector; using vb = vector; const double pi = 3.141592653589793238; const int inf = 1073741823; const ll infl = 1LL << 60; const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string abc = "abcdefghijklmnopqrstuvwxyz"; const ll MOD = 998244353; #include using namespace atcoder; using mint = modint998244353; using vm = vector; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n;cin>>n; vi A(n),B(n),idx(n+1);inp(A);inp(B); rep(i,0,n)idx[B[i]]=i; vectorans(n+1,vi(n)); ans[0]=A;ans[n]=B; rep(i,0,n-1){ vi &C=ans[i]; rep(j,0,n){ if(j==n-1){ ans[i+1][j]=C[j]; } else if(idx[C[j]]>idx[C[j+1]]){ ans[i+1][j]=C[j+1]; ans[i+1][j+1]=C[j]; j++; }else{ ans[i+1][j]=C[j]; } } } rep(i,0,n){ int &x=ans[n-1][i]; bool ok=false; rep(j,-1,2){ int id=i+j; if(id<0||id>=n)continue; if(x==ans[n][id])ok=true; } if(!ok){ cout<<-1<