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;
int son[400010],go[400010],f1[400010],f2[400010];
set<int> des[400010],mp[400010]; 
void adde(int u,int v)
{
	des[u].insert(v);des[v].insert(u);
	go[u]++;go[v]++;
}
int main()
{
	int n,r1,r2;scanf("%d",&n);
	for (int i=1;i<=n;i++)
	{
		scanf("%d",&f1[i]);
		if (f1[i]==-1) {r1=i;adde(2*n+1,r1);}
		else {adde(f1[i],i);son[f1[i]]^=1;}
	}
	for (int i=1;i<=n;i++)
	{
		scanf("%d",&f2[i]);
		if (f2[i]==-1) {r2=i;adde(2*n+1,r2+n);}
		else {adde(f2[i]+n,i+n);son[f2[i]+n]^=1;}
	}
	for (int i=1;i<=n;i++)
	{
		if (son[i]!=son[i+n]) {puts("IMPOSSIBLE");return 0;}
		if (!son[i]) adde(i,i+n);
	}
	for (int i=1;i<=n;i++) if (go[i]&1) assert(0);
	for (int s=1;s<=2*n+1;s++)
	while (des[s].size())
	{
		int now=s;
		while (1)
		{
			if (des[now].size()==0) assert(0);
			int d=*des[now].begin();des[now].erase(d);des[d].erase(now);
			mp[now].insert(d);
			now=d;if (d==s) break;
		}
	}
	puts("POSSIBLE");
	for (int i=1;i<=n;i++)
	{
		if (son[i]) printf("0 ");
		else if (mp[i].count(i+n)) printf("1 ");
		else printf("-1 ");
	}
}
	
	