// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 1e5 + 5;

int N;
int R1, R2;
vector<int> T1[MAXN], T2[MAXN];

void input()
{
    read(N);
    for (int i = 1; i <= N; ++i) {
        int f;
        read(f);
        if (~f)
            T1[f].push_back(i);
        else
            R1 = i;
    }
    for (int i = 1; i <= N; ++i) {
        int f;
        read(f);
        if (~f)
            T2[f].push_back(i);
        else
            R2 = i;
    }
}

vector<int> G[MAXN];
int parity[MAXN];
int ans[MAXN];

int get(vector<int> T[], int u)
{
    int last = parity[u] ? u : 0;
    for (int i = 0; i < SZ(T[u]); ++i) {
        int v = T[u][i];
        int t = get(T, v);
        if (last) {
            G[t].push_back(last);
            G[last].push_back(t);
            last = 0;
        } else
            last = t;
    }
    assert(last);
    return last;
}

void color(int u, int x)
{
    ans[u] = x;
    for (int i = 0; i < SZ(G[u]); ++i) {
        int v = G[u][i];
        if (ans[v]) {
            assert(ans[u] + ans[v] == 0);
            continue;
        }
        color(v, -x);
    }
}

void solve()
{
    for (int i = 1; i <= N; ++i) {
        if ((SZ(T1[i]) & 1) != (SZ(T2[i]) & 1)) {
            puts("IMPOSSIBLE");
            return;
        }
        parity[i] = !(SZ(T1[i]) & 1);
    }

    get(T1, R1);
    get(T2, R2);
    for (int i = 1; i <= N; ++i) {
        if (parity[i] && !ans[i])
            color(i, 1);
    }

    puts("POSSIBLE");
    for (int i = 1; i <= N; ++i) {
        printf("%d ", ans[i]);
    }
    puts("");
}

int main()
{
#ifdef __DEBUG
    freopen("F.in", "r", stdin);
    freopen("F.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 有子曰：“信近于义，言可复也。恭近于礼，远耻辱也。
//          因不失其亲，亦可宗也。” -- 论语


Measured memory_bytes: 18048