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;

const int MaxN=1e5+5;

int N;
int Col[MaxN];
bool Tag[MaxN];

vector<int> To[MaxN];

struct Tree{
	int Root;
	int Fa[MaxN],A[MaxN];
	bool P[MaxN];
	
	vector<int> Son[MaxN];
	
	void Init(){
		int i;
		for(i=1;i<=N;i++){
			scanf("%d",&Fa[i]);
			if(Fa[i]<0)
				Root=i;
			else Son[Fa[i]].push_back(i);
		}
	}
	
	void DFS(int u){
		int i,v,cnt=Son[u].size(),x,y;
		for(i=0;i<cnt;i++)
			DFS(Son[u][i]);
		for(i=0;i+1<cnt;i+=2){
			x=A[Son[u][i]],y=A[Son[u][i+1]];
			To[x].push_back(y);
			To[y].push_back(x);
			Tag[x]=Tag[y]=1;
		}
		if(Son[u].size()&1)
			A[u]=A[Son[u][cnt-1]];
		else A[u]=u,P[u]=1;
	}
}T1,T2;

void DFS(int u){
	int i,v;
	for(i=0;i<To[u].size();i++)
		if(!Col[v=To[u][i]])
			Col[v]=3-Col[u],DFS(v);
}

int main(){
	int i;
	scanf("%d",&N);
	T1.Init(),T2.Init();
	T1.DFS(T1.Root),T2.DFS(T2.Root);
	for(i=1;i<=N;i++)
		if(T1.P[i]^T2.P[i]){
			puts("IMPOSSIBLE");
			return 0;
		}
	puts("POSSIBLE");
	for(i=1;i<=N;i++)
		if(Tag[i]){
			if(!Col[i])
				Col[i]=1,DFS(i);
			printf("%d ",Col[i]<2?1:-1);
		}
		else printf("%d ",T1.P[i]);
	return 0;
}