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 <cstdio>
#include <vector>

const int MN = 100005, ME = 300005;

int N, A[MN], B[MN], R1, R2;

int deg1[MN], deg2[MN];
int E, eu[ME], ev[ME], dir[ME];
std::vector<int> G[MN * 2];

void DFS(int u) {
	while (!G[u].empty()) {
		int e = G[u].back();
		G[u].pop_back();
		if (!dir[e]) {
			int v = eu[e] ^ ev[e] ^ u;
			dir[e] = u == eu[e] ? 1 : 2;
			DFS(v);
		}
	}
}

int Ans[MN];

int main() {
	scanf("%d", &N);
	for (int i = 1; i <= N; ++i) scanf("%d", &A[i]);
	for (int i = 1; i <= N; ++i) scanf("%d", &B[i]);
	for (int i = 1; i <= N; ++i) {
		if (A[i] != -1) {
			++deg1[A[i]], ++deg1[i];
			++E, eu[E] = A[i], ev[E] = i;
			G[A[i]].push_back(E);
			G[i].push_back(E);
		} else R1 = i;
		if (B[i] != -1) {
			++deg2[B[i]], ++deg2[i];
			++E, eu[E] = N + B[i], ev[E] = N + i;
			G[N + B[i]].push_back(E);
			G[N + i].push_back(E);
		} else R2 = i;
	}
	++deg1[R1], ++deg2[R2];
	++E, eu[E] = N + N + 1, ev[E] = R1;
	G[N + N + 1].push_back(E), G[R1].push_back(E);
	++E, eu[E] = N + N + 1, ev[E] = N + R2;
	G[N + N + 1].push_back(E), G[N + R2].push_back(E);
	for (int i = 1; i <= N; ++i) if ((deg1[i] ^ deg2[i]) & 1) return puts("IMPOSSIBLE"), 0;
	puts("POSSIBLE");
	for (int i = 1; i <= N; ++i) if (deg1[i] & 1) {
		++E, eu[E] = i, ev[E] = N + i;
		G[i].push_back(E), G[N + i].push_back(E);
	}
	DFS(N + N + 1);
	for (int i = E; i > 2 * N; --i)
		Ans[eu[i]] = dir[i] == 1 ? 1 : -1;
	for (int i = 1; i <= N; ++i) printf("%d%c", Ans[i], " \n"[i == N]);
	return 0;
}