#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define _ << " " <<
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ull unsigned long long
#define lll __int128
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define BlueCrowner ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define MAX_N 5000
#define MAX_CALLS 70000
#define fail(s, x...) do { \
fprintf(stderr, s "\n", ## x); \
exit(1); \
} while(0)
/* Symbol obfuscation */
#define N koala
#define realS kangaroo
#define realD possum
#define inv platypus
#define num_calls echidna
static int N;
static int realS[MAX_N];
static int realD[MAX_N];
static int inv[MAX_N];
static int num_calls;
void answer(int S[], int D[]) {
int i;
int correct = 1;
for (i = 0; i < N; ++i)
if (S[i] != realS[i] || D[i] != realD[i]) {
correct = 0;
break;
}
if (correct)
printf("CORRECT\n");
else
printf("INCORRECT\n");
for (i = 0; i < N; ++i) {
if (i > 0)
printf(" ");
printf("%d", S[i]);
}
printf("\n");
for (i = 0; i < N; ++i) {
if (i > 0)
printf(" ");
printf("%d", D[i]);
}
printf("\n");
exit(0);
}
int tryCombination(int S[]) {
int i;
if (num_calls >= MAX_CALLS) {
printf("INCORRECT\nToo many calls to tryCombination().\n");
exit(0);
}
++num_calls;
for (i = 0; i < N; ++i)
if (S[inv[i]] != realS[inv[i]])
return i;
return -1;
}
int init() {
cin >> N;
FOR(i, 0, N) cin >> realS[i];
FOR(i, 0, N) {
cin >> realD[i];
inv[realD[i]] = i;
}
return N;
}
void exploreCave(int n) {
int s[n], d[n], used[n];
FOR(i, 0, n) {
s[i] = d[i] = used[i] = 0;
}
FOR(i, 0, n) {
ll cur = tryCombination(s);
if(cur == i) {
FOR(i, 0, n) if(!used[i]) s[i] ^= 1;
}
ll l = 0, r = n - 1;
ll pos = 0;
while(l <= r) {
ll m = (l + r) / 2;
int a[n];
FOR(i, 0, n) a[i] = s[i];
FOR(i, l, m + 1) {
if(!used[i]) a[i] ^= 1;
}
ll cur = tryCombination(a);
if(cur == i) {
pos = m;
r = m - 1;
}
else {
l = m + 1;
}
}
used[pos] = 1;
d[pos] = i;
}
answer(s, d);
}
int main() {
int N;
N = init();
exploreCave(N);
printf("INCORRECT\nYour solution did not call answer().\n");
return 0;
}
