There are two rooted trees, each with N vertices. The vertices of each tree are numbered 1 through N. In the first tree, the parent of Vertex i is Vertex A_i. Here, A_i=-1 if Vertex i is the root of the first tree. In the second tree, the parent of Vertex i is Vertex B_i. Here, B_i=-1 if Vertex i is the root of the second tree.

Snuke would like to construct an integer sequence of length N, X_1 , X_2 , ... , X_N, that satisfies the following condition:

* For each vertex on each tree, let the indices of its descendants including itself be a_1 , a_2 , ..., a_k. Then, abs(X_{a_1} + X_{a_2} + ... + X_{a_k})=1 holds.



Determine whether it is possible to construct such a sequence. If the answer is possible, find one such sequence.

Constraints

* 1 \leq N \leq 10^5
* 1 \leq A_i \leq N, if Vertex i is not the root in the first tree.
* A_i = -1, if Vertex i is the root in the first tree.
* 1 \leq B_i \leq N, if Vertex i is not the root in the second tree.
* B_i = -1, if Vertex i is the root in the second tree.
* Input corresponds to valid rooted trees.

Input

Input is given from Standard Input in the following format:


N
A_1 A_2 .. A_N
B_1 B_2 .. B_N


Output

If it is not possible to construct an integer sequence that satisfies the condition, print `IMPOSSIBLE`. If it is possible, print `POSSIBLE` in the first line. Then, in the second line, print X_1 , X_2 , ... , X_N, an integer sequence that satisfies the condition.

Examples

Input

5
3 3 4 -1 4
4 4 1 -1 1


Output

POSSIBLE
1 -1 -1 3 -1


Input

6
-1 5 1 5 1 3
6 5 5 3 -1 3


Output

IMPOSSIBLE


Input

8
2 7 1 2 2 1 -1 4
4 -1 4 7 4 4 2 4


Output

POSSIBLE
1 2 -1 0 -1 1 0 -1
// Crt. 2020-01-07  21:24:40
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <cstdio>
#define N 400005
using namespace std;

int n, rt[2], fa[2][N], iso[2][N], vis[N], ans[N];
vector<int> G[3][N];

inline void addE(int u, int v, int op) { G[op][u].push_back(v); }

int dfs(int u, int p, int op) {
    int son = 0; vector<int> stk;
    for (int i = G[op][u].size() - 1; ~i; --i) {
        int v = G[op][u][i];
        if (v == p) continue;
        int tmp = dfs(v, u, op);
        if (tmp) stk.push_back(tmp);
        ++son;
    } if (son % 2 == 0) stk.push_back(u), iso[op][u] = 1;
    for (int i = stk.size() - 1; i; i -= 2)
        addE(stk[i], stk[i - 1], 2), addE(stk[i - 1], stk[i], 2);
    int tmp = 0;
    if (stk.size() & 1) tmp = stk[0];
    return stk.clear(), tmp;
}

void dfs2(int u, int x) {
    vis[u] = 1, ans[u] = x;
    for (int i = G[2][u].size() - 1; ~i; --i) {
        int v = G[2][u][i];
        if (vis[v]) continue;
        dfs2(v, -x);
    }
}

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

    cin >> n;
    for (int k = 0; k < 2; ++k)
        for (int i = 1; i <= n; ++i) {
            scanf("%d", fa[k] + i);
            if (~fa[k][i]) addE(fa[k][i], i, k);
            else rt[k] = i;
        }

    for (int k = 0; k < 2; ++k)
        dfs(rt[k], 0, k);

    for (int i = 1; i <= n; ++i)
        if (iso[0][i] != iso[1][i])
            return puts("IMPOSSIBLE"), 0;

    for (int i = 1; i <= n; ++i)
        if ((iso[0][i] || iso[1][i]) && !vis[i])
            dfs2(i, -1);

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

    return 0;
}
