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
#include <bits/stdc++.h>
using namespace std;

const int Maxn = 200005;
int n, root1, root2, cnt, e[Maxn], deg[Maxn], head[Maxn];
struct edg
{
	int nxt, to, dir;
} edge[3 * Maxn];
void add(int x, int y)
{
	deg[x]++, deg[y]++;
	edge[++cnt] = (edg){head[x], y, -1};
	head[x] = cnt;
	edge[++cnt] = (edg){head[y], x, -1};
	head[y] = cnt;
}
void dfs(int u)
{
	for (int &i = head[u]; i; i = edge[i].nxt)
	{
		int to = edge[i].to;
		if (edge[i].dir != -1) continue;
		edge[i].dir = 1, edge[((i - 1) ^ 1) + 1].dir = 0;
		dfs(to);
	}
}
int main()
{
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
	{
		int x;
		scanf("%d", &x);
		if (x != -1) add(i, x);
		else root1 = i;
	}
	
	for (int i = 1; i <= n; i++)
	{
		int x;
		scanf("%d", &x);
		if (x != -1) add(1 + n + i, 1 + n + x);
		else root2 = 1 + n + i;
	}
	add(n + 1, root1), add(n + 1, root2);
	for (int i = 1; i <= n; i++)
		if ((deg[i] & 1) != (deg[n + 1 + i] & 1))
		{
			puts("IMPOSSIBLE");
			return 0;
		}
	puts("POSSIBLE");
	for (int i = 1; i <= n; i++)
		if (deg[i] & 1) add(i, n + 1 + i), e[i] = cnt - 1;
	for (int i = 1; i <= 2 * n + 1; i++)
		while (head[i]) dfs(i);
	for (int i = 1; i <= n; i++)
		if (e[i]) printf(edge[e[i]].dir ? "-1 " : "1 ");
		else printf("0 ");
	return 0;
}