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;

typedef long long lint;
typedef long double louble;

template<typename T1,typename T2> inline T1 max(T1 a,T2 b){return a<b?b:a;}
template<typename T1,typename T2> inline T1 min(T1 a,T2 b){return a<b?a:b;}

const char lf = '\n';

namespace ae86
{
	const int bufl = 1 << 15;

	char buf[bufl],*s=buf,*t=buf;

	inline int fetch()
	{
		if(s==t){t=(s=buf)+fread(buf,1,bufl,stdin);if(s==t)return EOF;}
		return *s++;
	}

	inline int ty()
	{
		int a=0;int b=1,c=fetch();
		while(!isdigit(c))b^=c=='-',c=fetch();
		while(isdigit(c))a=a*10+c-48,c=fetch();
		return b?a:-a;
	}
}
using ae86::ty;

const int _ = 100007 , __ = _ + _;

void failure(){cout<<"IMPOSSIBLE"<<lf;exit(0);}

int n;
vector<int> e[_];

struct oatww
{
	int rt,to[__],ne[__],he[_],ecnt;

	void adde(int a,int b){to[++ecnt]=b,ne[ecnt]=he[a],he[a]=ecnt;}

	void addde(int a,int b){adde(a,b),adde(b,a);}

	int du[_];

	int dfs(int x)
	{
		int a=0;
		du[x]=0;
		for(int i=he[x];i;i=ne[i])
		{
			int b=dfs(to[i]);du[x]++;
			if(!a)a=b;
			else e[a].emplace_back(b),e[b].emplace_back(a),a=0;
		}
		if(!a)a=x;
		return a;
	}

	void make()
	{
		for(int i=1,a;i<=n;i++)
		{
			a=ty();
			if(a==-1)rt=i;
			else adde(a,i);
		}
		int res=dfs(rt);
		e[res].emplace_back(res);
	}
	
	oatww()
	{
		memset(he,0,sizeof(he));
		ecnt=1;
	}
}t1,t2;

int col[_]={0};

void dfs(int x,int v)
{
	col[x]=v+v-1;
	for(auto b:e[x])if(!col[b])dfs(b,1-v);
}

int main()
{
	ios::sync_with_stdio(0),cout.tie(nullptr);

	n=ty(),t1.make(),t2.make();
	for(int i=1;i<=n;i++)if(t1.du[i]%2!=t2.du[i]%2)failure();

	for(int i=1;i<=n;i++)if(!col[i] && !e[i].empty())dfs(i,0);
	cout<<"POSSIBLE";
	for(int i=1;i<=n;i++)cout<<" \n"[i==1]<<col[i];
	cout<<lf;

	return 0;
}
