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>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#define SIZE 200005

using namespace std;
typedef pair <int,int> P;

vector <int> vec[SIZE];
int par[SIZE],dep[SIZE];
int pr[SIZE],ng[SIZE];
bool use[SIZE];
int n;

int rev(int v)
{
	if(v>=n) return v-n;
	return v+n;
}
int dfs(int v,int d)
{
	dep[v]=d;
	int a=-1;
	for(int i=0;i<vec[v].size();i++)
	{
		int to=vec[v][i];
		int tg=dfs(to,d+1);
		if(tg!=-1)
		{
			if(a==-1) a=tg;
			else
			{
				//printf("%d %d\n",a,tg);
				pr[a]=tg;
				pr[tg]=a;
				a=-1;
			}
		}
	}
	if(a==-1) a=v;
	return a;
}
int LCA(int a,int b)
{
	while(a!=b)
	{
		if(dep[a]>dep[b]) swap(a,b);
		b=par[b];
	}
	return a;
}
int main()
{
	scanf("%d",&n);
	for(int i=0;i<2*n;i++)
	{
		int p;
		scanf("%d",&p);p--;
		if(p<0) p=2*n;
		else if(i>=n) p+=n;
		par[i]=p;
		vec[p].push_back(i);
	}
	for(int i=0;i<n;i++)
	{
		if(vec[i].size()%2!=vec[i+n].size()%2)
		{
			puts("IMPOSSIBLE");
			return 0;
		}
	}
	memset(pr,-1,sizeof(pr));
	dfs(2*n,0);
	for(int i=0;i<2*n;i++)
	{
		if(!use[i]&&pr[i]!=-1)
		{
			use[i]=true;
			int now=i;
			do
			{
				use[now]=true;
				int to=pr[now];
				int p=LCA(now,to);
				//if(now==i) printf("%d %d : %d %d\n",now,to,p,i);
				for(int j=now;j!=p;j=par[j]) ng[j]=1;
				for(int j=to;j!=p;j=par[j]) ng[j]=-1;
				now=rev(to);
			}while(now!=i);
		}
	}
	puts("POSSIBLE");
	for(int i=0;i<n;i++)
	{
		int ret=ng[i];
		for(int j=0;j<vec[i].size();j++)
		{
			int to=vec[i][j];
			ret-=ng[to];
		}
		if(i!=0) printf(" ");
		printf("%d",ret);
	}puts("");
	return 0;
}
