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>
using namespace std;
#define MAXN 100010
int Adj[2][MAXN],V[2][MAXN],nxt[2][MAXN],c[2];
int Adj1[MAXN],V1[MAXN*2],nxt1[MAXN*2],c1;
void AddEdge(int u,int v,int f)
{
	c[f]++;V[f][c[f]]=v,nxt[f][c[f]]=Adj[f][u];Adj[f][u]=c[f];
}
void AddEdge(int u,int v)
{
	c1++;V1[c1]=v,nxt1[c1]=Adj1[u];Adj1[u]=c1;
}
int a[2][MAXN],vis[MAXN],ans[MAXN];
int st[MAXN],r,n;
void dfs(int u,int f)
{
	for(int i=Adj[f][u];i;i=nxt[f][i])
		dfs(V[f][i],f);
	if(a[f][u]==1) st[++r]=u;
	while(r>1)
	{
		AddEdge(st[r],st[r-1]);
		AddEdge(st[r-1],st[r]);
		r-=2;
	}
}
void dfsans(int u,int val)
{
	vis[u]=1;
	ans[u]=val;
	for(int i=Adj1[u];i;i=nxt1[i])
		if(!vis[V1[i]])
			dfsans(V1[i],-val);
}
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		a[0][i]=a[1][i]=1;
	int p,rt1,rt2;
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&p);
		if(p==-1) rt1=i;
		else a[0][p]^=1,AddEdge(p,i,0);
	}
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&p);
		if(p==-1) rt2=i;
		else a[1][p]^=1,AddEdge(p,i,1);
	}
	for(int i=1;i<=n;i++)
		if(a[0][i]!=a[1][i])
		{
			printf("IMPOSSIBLE\n");
			return 0;
		}
	printf("POSSIBLE\n");
	dfs(rt1,0);
	r=0;
	dfs(rt2,1);
	for(int i=1;i<=n;i++)
		if(!vis[i])
			dfsans(i,1);
	for(int i=1;i<=n;i++)
		if(a[0][i]) printf("%d ",ans[i]);
		else printf("0 ");
	printf("\n");
}