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<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<cctype>
#include<set>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef long long LL;

inline int read() {
	int x=0,f=1;char ch=getchar();for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-1;
	for(;isdigit(ch);ch=getchar())x=x*10+ch-'0';return x*f;
}

const int N = 500005;
struct Edge{
	int fr, to, nxt; 
}e[N << 1];
int head[N], f1[N], f2[N], c1[N], c2[N], sk[N << 1], ans[N], top = 0, En = 1;
bool vis[N << 1];

inline void add_edge(int u,int v) {
//	cout << u << " " << v << "\n";
	++En; e[En].fr = u, e[En].to = v, e[En].nxt = head[u]; head[u] = En;
	++En; e[En].fr = v, e[En].to = u, e[En].nxt = head[v]; head[v] = En;
}
void dfs(int u) {
	while (1) {
		int k = head[u]; 
		if (!k) break;
		head[u] = e[k].nxt;
		if (!vis[k]) {
			vis[k] = vis[k ^ 1] = 1;
			dfs(e[k].to);
			sk[++top] = k;
		}
	}
}
int main() {
	int n = read();
	for (int i = 1; i <= n; ++i) {
		int x = read();
		if (x == -1) x = 0;
		f1[i] = x, c1[x] ++;
		add_edge(x, i);
	}
	for (int i = 1; i <= n; ++i) {
		int x = read();
		if (x == -1) x = 0;
		f2[i] = x, c2[x] ++;
		if (x == 0) add_edge(x, i + n);
		else add_edge(x + n, i + n);
	}
	for (int i = 1; i <= n; ++i) {
		if (c1[i] % 2 != c2[i] % 2) { puts("IMPOSSIBLE"); return 0; }
		if ((c1[i] & 1) && (c2[i] & 1)) ans[i] = 0;
		else add_edge(i, i + n);
	}
	puts("POSSIBLE");
	dfs(0);
	for (int i = top; i >= 1; --i) {
		int k = sk[i];
		if (e[k].fr + n == e[k].to) ans[e[k].fr] = 1;
		if (e[k].fr - n == e[k].to) ans[e[k].fr - n] = -1;
	}
	for (int i = 1; i <= n; ++i) {
		printf("%d ", ans[i]);
	}
	return 0;
}