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>
#define reg register
typedef long long ll;
using namespace std;
const int MN=1e5+5;
int to[MN*8],nxt[MN*8],h[2][MN*2],cnt=1;
inline void ins(int s,int t,int* h){
	to[++cnt]=t;nxt[cnt]=h[s];h[s]=cnt;
	to[++cnt]=s;nxt[cnt]=h[t];h[t]=cnt;
}
int n,fa[2][MN],root[2],deg[2][MN];
void dfs1(int st,int idx){
	for(reg int i=h[idx][st];i;i=nxt[i])
		if(to[i]!=fa[idx][st])
			deg[idx][st]^=1,dfs1(to[i],idx);
}
int vis[MN*4],id[MN];
void dfs2(int st){
	for(reg int& i=h[0][st];i;i=nxt[i])
		if(!vis[i/2])
			vis[i/2]=(to[i]>n)+1,dfs2(to[i]);
}
int main(){
	scanf("%d",&n);
	for(reg int i=1;i<=n;i++){
		scanf("%d",fa[0]+i);deg[0][i]=1;
		if(fa[0][i]==-1)root[0]=i;
		else ins(fa[0][i],i,h[0]);
	}
	for(reg int i=1;i<=n;i++){
		scanf("%d",fa[1]+i);deg[1][i]=1;
		if(fa[1][i]==-1)root[1]=i;
		else ins(fa[1][i],i,h[1]);
	}
	dfs1(root[0],0);dfs1(root[1],1);
	for(reg int i=1;i<=n;i++)
		if(deg[0][i]^deg[1][i])
			return 0*puts("IMPOSSIBLE");
	for(reg int i=1;i<=n;i++){
		if(~fa[1][i])ins(fa[1][i]+n,i+n,h[0]);
		if(deg[0][i])ins(i,i+n,h[0]),id[i]=cnt/2;
	}
	ins(root[0],n+n+1,h[0]);
	ins(root[1]+n,n+n+1,h[0]);
	dfs2(n+n+1);puts("POSSIBLE");
	for(reg int i=1;i<=n;i++){
		if(deg[0][i])printf("%d ",vis[id[i]]==1?-1:1);
		else printf("0 ");
	}
	return 0;
}