#include <iostream>
#include <vector>
using namespace std;

const int N = 100 * 1000 + 10;

int n;
bool mark[N];
int nxt[N], color[N];
vector <int> adj[N];

struct Tree {
    int root;
    vector <int> child[N];

    int match(int v) {
        for (int pnt = 1; pnt < child[v].size(); pnt += 2) {
            int x = match(child[v][pnt - 1]), y = match(child[v][pnt]);
            adj[x].push_back(y);
            adj[y].push_back(x);
        }

        if (child[v].size() % 2)
            return match(child[v].back());
        return v;
    }
} T[2];

void input() {
    cin.tie(0);
    cin >> n;

    int pr;
    for (int j = 0; j < 2; j++)
        for (int i = 1; i <= n; i++) {
            cin >> pr;
            if (pr == -1)
                T[j].root = i;
            else
                T[j].child[pr].push_back(i);
        }
    return;
}

void run(int v) {
    mark[v] = true;
    for (int u : adj[v])
        if (!mark[u]) {
            color[u] = color[v] * -1;
            run(u);
        }
    return;
}

void solve() {
    for (int i = 1; i <= n; i++)
        if (T[0].child[i].size() % 2 != T[1].child[i].size() % 2) {
            cout << "IMPOSSIBLE" << endl;
            exit(0);
        }

    T[0].match(T[0].root);
    T[1].match(T[1].root);

    for (int i = 1; i <= n; i++)
        if (!mark[i] && !(T[0].child[i].size() % 2)) {
            color[i] = 1;
            run(i);
        }
    return;
}

void output() {
    cout.tie(0);
    cout << "POSSIBLE\n";

    for (int i = 1; i <= n; i++)
        cout << color[i] << ' ';

    cout << endl;
    return;
}

int main() {
    ios::sync_with_stdio(false);
    input();
    solve();
    output();
    return 0;
}
