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 <cstdlib>

const int MAXN=100011, MAXV=MAXN<<1, MAXE=MAXV<<1;

int abs(int a){
	return (a>0)?a:(-a);
}

int fu(int a){
	return (a<0)?(-1):1;
}

int N;
int A[MAXN], B[MAXN];
int Ad[MAXN], Bd[MAXN];
int Ar, Br;
int Se[MAXN], Deg[MAXN];

struct Vert{
	int FE;
} V[MAXV];

int Vcnt;
int Av[MAXN], Bv[MAXN], Sour;

struct Edge{
	int y, id, next;
} E[MAXE<<1];

int Ecnt, Ec;
int Vis[MAXE];

void addE(int a, int b){
	++Ec;
	++Ecnt;
	E[Ecnt].y=b;E[Ecnt].id=+Ec;E[Ecnt].next=V[a].FE;V[a].FE=Ecnt;
	++Ecnt;
	E[Ecnt].y=a;E[Ecnt].id=-Ec;E[Ecnt].next=V[b].FE;V[b].FE=Ecnt;
}

void DFS(int at){
	for(int k=V[at].FE;k;k=V[at].FE){
		while(Vis[abs(E[k].id)])	k=E[k].next;
		V[at].FE=k;
		if(k){
			Vis[abs(E[k].id)]=fu(E[k].id);
			DFS(E[k].y);
		}
	}
}

void Show(bool i){
	if(i)	puts("POSSIBLE");
	else	puts("IMPOSSIBLE");
}

void Test_Deg(){
	bool ret=true;
	for(int i=1;i<=N;++i)	ret&=((Ad[i]&1)==(Bd[i]&1));
	if(!ret){
		Show(false);
		exit(0);
	}
}

void Test_Eu(){
	bool ret=true;
	for(int i=1;i<=Ec;++i)
		ret&=(Vis[i]!=0);
	if(!ret){
		Show(false);
		exit(0);
	}
}

int main(){
	
	scanf("%d", &N);
	for(int i=1;i<=N;++i)	scanf("%d", &A[i]);
	for(int i=1;i<=N;++i)	scanf("%d", &B[i]);
	
	for(int i=1;i<=N;++i){
		if(A[i]==-1)	{Ar=i;++Ad[i];}
		else	{++Ad[i];++Ad[A[i]];}
		if(B[i]==-1)	{Br=i;++Bd[i];}
		else	{++Bd[i];++Bd[B[i]];}
	}
	
	Test_Deg();
	
	for(int i=1;i<=N;++i)	Deg[i]=Ad[i]&Bd[i]&1;
	
	Sour=++Vcnt;
	for(int i=1;i<=N;++i)
		{Av[i]=++Vcnt;Bv[i]=++Vcnt;}
	
	addE(Av[Ar], Bv[Br]);
	for(int i=1;i<=N;++i){
		if(A[i]!=-1)	addE(Av[i], Av[A[i]]);
		if(B[i]!=-1)	addE(Bv[i], Bv[B[i]]);
		if(Deg[i])	{addE(Av[i], Bv[i]);Se[i]=Ec;}
	}
	
	DFS(Vcnt);
	
	Test_Eu();
	
	Show(true);
	for(int i=1;i<=N;++i){
		if(!Se[i])	printf("0 ");
		else	printf("%d ", Vis[Se[i]]);
	}
	
	return 0;
}