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 <algorithm>
#include <cstdio>
using std::min;

const int MAXN = 150010;

int n, ce, d[MAXN * 2], ans[MAXN];
struct EDGE { int v; bool x; EDGE *n, *b; } edge[MAXN * 6], *head[MAXN * 2], *cur[MAXN * 2];

void AddEdge(const int u, const int v) {
	edge[ce + 1] = { v, false, head[u], edge + ce + 2 };
	edge[ce + 2] = { u, false, head[v], edge + ce + 1 };
	head[u] = edge + ce + 1;
	head[v] = edge + ce + 2;
	ce += 2;
}

inline void SetEdge(EDGE *e, const bool x) {
	e->b->x = e->x = x;
}

inline void UpdateAns(const int u, const int v) {
	if (static_cast<int>(u <= n) + (v <= n) == 1) {
		int p = min(u, v);
		ans[p] = u == p ? 1 : -1;
	}
}

void FindEulerPath(const int u) {
	// if (d[u] == 1)
	// 	return;
	d[u] --;

	for (EDGE *&e = cur[u]; e; e = e->n) {
		if (e->x || d[e->v] <= 0)
			continue;
		SetEdge(e, true);
		UpdateAns(u, e->v);
		d[u] --;
		FindEulerPath(e->v);
		if (!e)
			break;
	}
}

int main() {
	scanf("%d", &n);

	for (int i = 1, p; i <= n; i++) {
		scanf("%d", &p);
		if (p != -1) {
			AddEdge(p, i);
			d[p] ++;
		}
		else {
			AddEdge(0, i);
			d[0] ++;
		}
		d[i] ++;
	}

	for (int i = 1, p; i <= n; i++) {
		scanf("%d", &p);
		if (p != -1) {
			AddEdge(p + n, i + n);
			d[p + n] ++;
		}
		else {
			AddEdge(0, i + n);
			d[0] ++;
		}
		d[i + n] ++;
	}

	for (int i = 1; i <= n; i++)
		if ((d[i] ^ d[i + n]) & 1) {
			puts("IMPOSSIBLE");
			return 0;
		}

	for (int i = 1; i <= n; i++)
		if (d[i] & 1) {
			d[i] ++;
			d[i + n] ++;
			AddEdge(i, i + n);
		}

	for (int i = 0; i <= n * 2; i++)
		cur[i] = head[i];

	FindEulerPath(0);

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

	return 0;
}
