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<cstring>
#define maxn 100005
int n,r1,r2,s1[maxn],s2[maxn],ans[maxn],ma[maxn];
bool vis[maxn];
struct node { int v; node *nxt; } edge[maxn*16],*head[3][maxn],*ncnt;
void addedge(int u,int v,int d)
{
	ncnt++;
	ncnt->v=v,ncnt->nxt=head[d][u];
	head[d][u]=ncnt;
}
int s[maxn],top;
void dfs(int d,int u)
{
    if(s1[u]==0)
        s[++top]=u;
	for(node *p=head[d][u];p;p=p->nxt)
	{
		int v=p->v;
		dfs(d,v);
	}
}
void dfs2(int u,int c)
{
	ans[u]=c,vis[u]=true;
	for(node *p=head[2][u];p;p=p->nxt)
	{
		int v=p->v;
		if(!vis[v]) dfs2(v,-c);
	}
}
int main()
{
	ncnt=&edge[0];
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		int fa;
		scanf("%d",&fa);
		if(fa>0) { addedge(fa,i,0); s1[fa]^=1; }
		else r1=i;
	}
	for(int i=1;i<=n;i++)
	{
		int fa;
		scanf("%d",&fa);
		if(fa>0) { addedge(fa,i,1); s2[fa]^=1; }
		else r2=i;
	}
	for(int i=1;i<=n;i++)
		if(s1[i]!=s2[i]) { printf("IMPOSSIBLE\n"); return 0; }
	printf("POSSIBLE\n");
	top=0;
	dfs(0,r1);
	while(top>=2){
        ma[s[top]]=s[top-1];
        ma[s[top-1]]=s[top];
        top-=2;
	}
	for(int i=1;i<=n;i++)
		if(ma[i]) addedge(i,ma[i],2);
	memset(ma,0,sizeof(ma));
	top=0;
	dfs(1,r2);
	while(top>=2){
        ma[s[top]]=s[top-1];
        ma[s[top-1]]=s[top];
        top-=2;
	}
	for(int i=1;i<=n;i++)
		if(ma[i]) addedge(i,ma[i],2);
	for(int i=1;i<=n;i++)
		if(!vis[i]) dfs2(i,1);
	for(int i=1;i<=n;i++) printf("%d ",s1[i]?0:ans[i]);
}
