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<bits/stdc++.h>

using namespace std;

#define N 120000

int n,rta,rtb,sa[N],sb[N],A[N],B[N],c[N];
vector<int> a[N],b[N],g[N];
bool vis[N];

void add(int x,int y){
	g[x].push_back(y); g[y].push_back(x);
}

void dfs1(int u){
	for (int v:a[u]){
		sa[u]^=1;
		dfs1(v);
		if (A[u]){add(A[u],A[v]); A[u]=0;}
		else A[u]=A[v];
	}
	if (!A[u]) A[u]=u;
}

void dfs2(int u){
	for (int v:b[u]){
		sb[u]^=1;
		dfs2(v);
		if (B[u]){add(B[u],B[v]); B[u]=0;}
		else B[u]=B[v];
	}
	if (!B[u]) B[u]=u;
}

void dfs(int u){
	vis[u]=1;
	for (int v:g[u]) if (!vis[v]){c[v]=-c[u]; dfs(v);}
}

int main(){
	scanf("%d",&n);
	for (int i=1;i<=n;++i){
		int x; scanf("%d",&x);
		if (~x) a[x].push_back(i); else rta=i;
	}
	for (int i=1;i<=n;++i){
		int x; scanf("%d",&x);
		if (~x) b[x].push_back(i); else rtb=i;
	}
	dfs1(rta); dfs2(rtb);
	for (int i=1;i<=n;++i){
		if (sa[i]^sb[i]){puts("IMPOSSIBLE"); return 0;}
		if (sa[i]) vis[i]=1;
	}
	for (int i=1;i<=n;++i) if (!vis[i]){c[i]=1; dfs(i);}
	puts("POSSIBLE");
	for (int i=1;i<=n;++i) printf(i==n?"%d\n":"%d ",c[i]);
	
	return 0;
}
			