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<vector>
using namespace std;
const int MAXN=100005;

int N;
int rt1,rt2;
vector<int> adj1[MAXN],adj2[MAXN],adj[MAXN];
int stk[MAXN],tp;
bool vis[MAXN];
int ans[MAXN];

void dfs(int u,const vector<int> G[])
{
	for(auto v:G[u])
		dfs(v,G);
	if((G[u].size()&1)==0)
		stk[++tp]=u;
	while(tp>=2)
	{
		adj[stk[tp]].push_back(stk[tp-1]);
		adj[stk[tp-1]].push_back(stk[tp]);
		tp-=2;
	}
}
void Mark(int u,int val=1)
{
	vis[u]=true;
	ans[u]=val;
	for(auto v:adj[u])
	{
		if(vis[v])
			continue;
		Mark(v,-val);
	}
}

int main()
{
	scanf("%d",&N);
	for(int i=1;i<=N;i++)
	{
		int f;
		scanf("%d",&f);
		if(f==-1)
			rt1=i;
		else
			adj1[f].push_back(i);
	}
	for(int i=1;i<=N;i++)
	{
		int f;
		scanf("%d",&f);
		if(f==-1)
			rt2=i;
		else
			adj2[f].push_back(i);
	}
	for(int i=1;i<=N;i++)
		if((adj1[i].size()&1)!=(adj2[i].size()&1))
		{
			puts("IMPOSSIBLE");
			return 0;
		}
	puts("POSSIBLE");
	tp=0;
	dfs(rt1,adj1);
	tp=0;
	dfs(rt2,adj2);
	for(int i=1;i<=N;i++)
		if(!vis[i])
			Mark(i);
	for(int i=1;i<=N;i++)
	{
		if(adj1[i].size()&1)
			printf("0 ");
		else
			printf("%d ",ans[i]);
	}
	puts("");
	
	return 0;
}
