#include <bits/stdc++.h>
using namespace std;

#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int MOD2 = 1007681537;
const int INF = (int) 1e9;
const ll LINF = (ll) 1e18;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
inline ll isqrt(ll k) {ll r = sqrt(k) + 1; while (r * r > k) r--; return r;}
inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}
#define db(x) cerr << #x << " = " << (x) << " ";
#define endln cerr << "\n";

const int maxn = 1e5 + 5;
int n;
vi adj1[maxn];
vi adj2[maxn];
int f1[maxn];
int f2[maxn];
vi adj[maxn];
int vis[maxn];

int dfs1(int u) {
    f1[u] = 1;
    vi ver;
    FOR(i, 0, sz(adj1[u])) {
        int v = adj1[u][i];
        int r = dfs1(v);
        if (~r) ver.pb(r);
        f1[u] ^= 1;
    }
    if (f1[u]) {
        ver.pb(u);
    }
    FOR(i, 0, sz(ver) >> 1) {
        int x = ver[i + i];
        int y = ver[i + i + 1];
        adj[x].pb(y), adj[y].pb(x);
    }
    if (sz(ver) & 1) {
        return ver.back();
    }
    return -1;
}

int dfs2(int u) {
    f2[u] = 1;
    vi ver;
    FOR(i, 0, sz(adj2[u])) {
        int v = adj2[u][i];
        int r = dfs2(v);
        if (~r) ver.pb(r);
        f2[u] ^= 1;
    }
    if (f2[u]) {
        ver.pb(u);
    }
    FOR(i, 0, sz(ver) >> 1) {
        int x = ver[i + i];
        int y = ver[i + i + 1];
        adj[x].pb(y), adj[y].pb(x);
    }
    if (sz(ver) & 1) {
        return ver.back();
    }
    return -1;
}

void dfs(int u) {
    vis[u] = 1;
    FOR(i, 0, sz(adj[u])) {
        int v = adj[u][i];
        if (!vis[v]) {
            f1[v] = -f1[u];
            dfs(v);
        }
    }
}

void solve() {
    cin >> n;
    int rt1 = 0, rt2 = 0;
    FOR(i, 0, n) {
        int a; cin >> a;
        if (a == -1) {
            rt1 = i;
        }
        else {
            a--;
            adj1[a].pb(i);
        }
    }
    FOR(i, 0, n) {
        int b; cin >> b;
        if (b == -1) {
            rt2 = i;
        }
        else {
            b--;
            adj2[b].pb(i);
        }
    }
    dfs1(rt1), dfs2(rt2);
    FOR(i, 0, n) if (f1[i] != f2[i]) {
        cout << "IMPOSSIBLE\n";
        return;
    }
    FOR(i, 0, n) if (f1[i] && !vis[i]) dfs(i);
    cout << "POSSIBLE\n";
    FOR(i, 0, n) cout << f1[i] << " \n"[i == n - 1];
}

int main() {
    int JUDGE_ONLINE = 1;
    if (fopen("in.txt", "r")) {
        JUDGE_ONLINE = 0;
        assert(freopen("in.txt", "r", stdin));
        //assert(freopen("out.txt", "w", stdout));
    }
    else {
        //ios_base::sync_with_stdio(0), cin.tie(0);
    }
    solve();
    if (!JUDGE_ONLINE) {
        //cout << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
    }
    return 0;
}

Measured memory_bytes: 22400