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>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#define SF scanf
#define PF printf
#define MAXN 100010
using namespace std;
vector<int> a[MAXN],b[MAXN];
int col[MAXN];
bool flaga[MAXN],flagb[MAXN];
void add_edge(int x,int y){
	b[x].push_back(y);
	b[y].push_back(x);
}
int n,las;
int st[MAXN],top;
int dfn[MAXN],tot;
void dfs(int x,int flag){
	dfn[x]=++tot;
	if(a[x].size()%2==0){
		st[++top]=x;
		if(flag==0)
			flaga[x]=1;
		else
			flagb[x]=1;
	}
	for(int i=0;i<int(a[x].size());i++)
		dfs(a[x][i],flag);
	while(top>1&&dfn[st[top-1]]>=dfn[x]){
		add_edge(st[top],st[top-1]);
		top-=2;	
	}
}
queue<int> q;
void bfs(int x){
	col[x]=1;
	q.push(x);
	while(!q.empty()){
		int x=q.front();
		q.pop();
		for(int i=0;i<int(b[x].size());i++){
			int u=b[x][i];
			if(col[u]!=0)
				continue;
			col[u]=-col[x];
			q.push(u);	
		}
	}
}

int main(){
	SF("%d",&n);
	int u,rt;
	for(int i=1;i<=n;i++){
		SF("%d",&u);
		if(u!=-1)
			a[u].push_back(i);	
		else
			rt=i;
	}
	dfs(rt,0);
	las=0;
	for(int i=1;i<=n;i++) 
		a[i].clear();
	for(int i=1;i<=n;i++){
		SF("%d",&u);
		if(u!=-1)
			a[u].push_back(i);	
		else
			rt=i;
	}
	top=0;
	dfs(rt,1);
	for(int i=1;i<=n;i++)
		if(flaga[i]!=flagb[i]){
			PF("IMPOSSIBLE");
			return 0;
		}
	PF("POSSIBLE\n");
	for(int i=1;i<=n;i++)
		if(col[i]==0&&flaga[i]==1)
			bfs(i);
	for(int i=1;i<=n;i++)
		PF("%d ",col[i]);
}