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 <iostream>
#include <cstdio>
#define IsDigit(x) ((x) >= '0' && (x) <= '9')
using namespace std;

int n, pos;
int last[200001], parity[200001], cross_edge[100001];
struct Edge{
	int y, prev, dir;
}edge[600000];


int Read(void)
{
	int c, ret(0);
	bool sign(false);
	
	c = getchar();
	while (!IsDigit(c) && c != '-')
		c = getchar();
	c == '-' && (sign = true, c = getchar());
	do
		ret = ret * 10 + c - '0';
	while ((c = getchar()) && IsDigit(c));
	return sign ? -ret : ret;
}


inline void AddBiEdge(const int x, const int y)
{
	edge[pos].y = y;
	edge[pos].prev = last[x];
	last[x] = pos++;
	edge[pos].y = x;
	edge[pos].prev = last[y];
	last[y] = pos++;
	return;
}


int main()
{
	int ance, root_A, root_B, curr;
	
	n = Read();
	pos = 2;
	for (int i = 1; i <= n; ++i) {
		ance = Read();
		if (ance == -1)
			root_A = i;
		else {
			AddBiEdge(i, ance);
			++parity[ance];
		}
	}
	for (int i = 1; i <= n; ++i) {
		ance = Read();
		if (ance == -1)
			root_B = n + i;
		else {
			AddBiEdge(n + i, n + ance);
			++parity[n + ance];
		}
	}
	for (int i = 1; i <= n; ++i)
		if ((parity[i] & 1) ^ (parity[n + i] & 1)) {
			printf("IMPOSSIBLE\n");
			return 0;
		}
		else
			if (~parity[i] & 1) {
				AddBiEdge(i, n + i);
				cross_edge[i] = pos - 2;
			}
	AddBiEdge(root_A, root_B);
	for (int src = 1; src <= n << 1; ++src) {
		while (last[src] && edge[last[src]].dir)
			last[src] = edge[last[src]].prev;
		if (!last[src])
			continue;
		curr = src;
		do {
			while (edge[last[curr]].dir)
				last[curr] = edge[last[curr]].prev;
			edge[last[curr]].dir = 1;
			edge[last[curr] ^ 1].dir = 2;
			curr = edge[last[curr]].y;
		}
		while (curr != src);
	}
	printf("POSSIBLE\n");
	for (int i = 1; i <= n; ++i)
		if (cross_edge[i])
			printf(edge[cross_edge[i]].dir == 1 ? "-1 " : "1 ");
		else
			printf("0 ");
	printf("\n");
	return 0;
}

