#include <bits/stdc++.h>

#define HEAP priority_queue
#define rep(i, n) for(int i = 0, _end_ = (n); i < _end_; ++i)
#define per(i, n) for(int i = (n) - 1; i >= 0 ; --i)
#define forn(i, l, r) for(int i = (l), _end_ = (r); i <= _end_; ++i)
#define nrof(i, r, l) for(int i = (r), _end_ = (l); i >= _end_; --i)
#define FOR(a, b) for(auto (a): (b))
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define X first
#define Y second
#define eps 1e-6
#define pi 3.1415926535897932384626433832795
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(), x.end()

using namespace std;

typedef long long LL;
typedef double flt;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef pair<int,int> pii;
typedef pair<int,LL> pil;
typedef pair<LL,int> pli;
typedef pair<LL,LL> pll;
typedef vector<pil> vil;
typedef vector<pii> vii;
typedef vector<pli> vli;
typedef vector<pll> vll;

const int iinf = 1e9 + 7;
const int oo = 0x3f3f3f3f;
const LL linf = 1ll << 60;
const flt dinf = 1e60;

template <typename T> inline void scf(T &x)
{
    bool f = 0;
    x = 0;
    char c = getchar();
    while(c != '-' && (c < '0' || c > '9')) c = getchar();
    if(c == '-') f = 1, c = getchar();
    while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
    if(f) x = -x;
    return;
}

template <typename T1, typename T2> void scf(T1 &x, T2 &y)
{
    scf(x);
    return scf(y);
}

template <typename T1, typename T2, typename T3> void scf(T1 &x, T2 &y, T3 &z)
{
    scf(x);
    scf(y);
    return scf(z);
}

template <typename T1, typename T2, typename T3, typename T4> void scf(T1 &x, T2 &y, T3 &z, T4 &w)
{
    scf(x);
    scf(y);
    scf(z);
    return scf(w);
}

inline char mygetchar()
{
    char c = getchar();
    while(c == ' ' || c == '\n') c = getchar();
    return c;
}

template <typename T> inline bool chkmax(T &x, const T &y)
{
    return y > x ? x = y, 1 : 0;
}

template <typename T> inline bool chkmin(T &x, const T &y)
{
    return y < x ? x = y, 1 : 0;
}

#ifdef DEBUG
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#endif

//---------------------------------------------------------head----------------------------------------------------

const int maxn = 1e5 + 100;

int n, ra, rb;
int x[maxn];
vi ga[maxn], gb[maxn], g[maxn];

int dfsa(int u = ra) {
    int ret = SZ(ga[u]) & 1 ? 0 : u;
    for (int v: ga[u]) {
        int w = dfsa(v);
        if(w) {
            if(ret) {
                g[w].pb(ret);
                g[ret].pb(w);
                ret = 0;
            }
            else {
                ret = w;
            }
        }
    }
    return ret;
}

int dfsb(int u = rb) {
    int ret = SZ(gb[u]) & 1 ? 0 : u;
    for (int v: gb[u]) {
        int w = dfsb(v);
        if(w) {
            if(ret) {
                g[w].pb(ret);
                g[ret].pb(w);
                ret = 0;
            }
            else {
                ret = w;
            }
        }
    }
    return ret;
}

void dfs(int u, int c = 1) {
    x[u] = c;
    for (int v: g[u]) {
        if(!x[v]) {
            dfs(v, -c);
        }
    }
    return;
}

int main()
{
    scf(n);
    forn(i, 1, n) {
        int p;
        scf(p);
        if(~p) {
            ga[p].pb(i);
        }
        else {
            ra = i;
        }
    }
    forn(i, 1, n) {
        int p;
        scf(p);
        if(~p) {
            gb[p].pb(i);
        }
        else {
            rb = i;
        }
    }
    forn(i, 1, n) {
        if(SZ(ga[i]) - SZ(gb[i]) & 1) {
            puts("IMPOSSIBLE");
            return 0;
        }
    }
    dfsa();
    dfsb();
    forn(i, 1, n) {
        if((~SZ(ga[i]) & 1) && !x[i]) {
            dfs(i);
        }
    }
    puts("POSSIBLE");
    forn(i, 1, n) {
        printf("%d%c", x[i], " \n"[i == n]);
    }
    return 0;
}


Measured memory_bytes: 15232