Problem: 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

Solution (in CPP):

Solution:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#define N 301000
template<typename T> inline void read(T &x) {
	x = 0; char c = getchar(); bool flag = false;
	while (!isdigit(c)) { if (c == '-') flag = true; c = getchar(); }
	while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
	if (flag)	x = -x;
}
using namespace std;
int n, Rt;
int cnt[N];
int fa1[N], fa2[N];
struct edge{
	int nxt, to;
}e[N << 1];
int head[N], ecnt = 1;
inline void addedge(int from, int to) {
	e[++ecnt] = (edge){head[from], to};
	head[from] = ecnt;
}

int blong[N];
bool evis[N << 1], etype[N << 1];
void dfs(int cur) {
	for (int &i = head[cur]; i; i = e[i].nxt) {
		if (evis[i])	continue;
		evis[i] = evis[i ^ 1] = true;
		etype[i] = true;
		int to = e[i].to; dfs(to);
	}
}

int main() {
	read(n); Rt = n + n + 1;
	for (int i = 1; i <= n; ++i) {
		read(fa1[i]);
		if (fa1[i] == -1)	fa1[i] = Rt;
		addedge(fa1[i], i); addedge(i, fa1[i]);
		++cnt[fa1[i]];
	}
	for (int i = 1; i <= n; ++i) {
		read(fa2[i]);
		if (fa2[i] == -1)	fa2[i] = Rt;
		else	fa2[i] += n;
		addedge(fa2[i], i + n); addedge(i + n, fa2[i]);
		++cnt[fa2[i]];
	}
	for (int i = 1; i <= n; ++i) {
		if ((cnt[i] & 1) != (cnt[i + n] & 1)) {
			puts("IMPOSSIBLE");
			return 0;
		}
		if (!(cnt[i] & 1))
			addedge(i, i + n), blong[i] = ecnt, addedge(i + n, i);
	}
	puts("POSSIBLE");
	dfs(1);
	for (int i = 1; i <= n; ++i) {
		if (cnt[i] & 1)	printf("0 ");
		else	printf("%d ", etype[blong[i]] ? 1 : -1);
	}
	return 0;
}