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;
struct pat{int x,y;pat(int x=0,int y=0):x(x),y(y){}bool operator<(const pat &p)const{return x==p.x?y<p.y:x<p.x;}};
template<typename TP>inline void read(TP &tar)
{
	TP ret=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){ret=ret*10+(ch-'0');ch=getchar();}
	tar=ret*f;
}
template<typename TP,typename... Args>inline void read(TP& t,Args&... args){read(t),read(args...);}
namespace RKK
{
const int N=100011;
int n;
vector<int> mp[N];int col[N];
void link(int x,int y){mp[x].push_back(y),mp[y].push_back(x);}
void paint(int x,int c=1){col[x]=c;for(auto t:mp[x])if(!col[t]) paint(t,-c);}
struct remi
{
	struct sumireko{int to,ne;}e[N];int he[N],ecnt;
	void addline(int f,int t){e[++ecnt].to=t;e[ecnt].ne=he[f],he[f]=ecnt;}
	int rt,fa[N],sonc[N];
	void init()
	{
		for(int i=1;i<=n;i++)
		{
			read(fa[i]);if(!~fa[i]) rt=i,fa[i]=0;
			else addline(fa[i],i),sonc[fa[i]]++;
		}
	}
	int dfs(int x)
	{
		vector<int> ve;
		if(!(sonc[x]&1)) ve.push_back(x);
		for(int i=he[x],t=e[i].to;i;i=e[i].ne,t=e[i].to) ve.push_back(dfs(t));
		sort(ve.begin(),ve.end());for(int i=1;i<ve.size()-1;i+=2) link(ve[i],ve[i+1]);
		return ve[0];
	}
	void work(){dfs(rt);}
}TA,TB;
int main()
{
	#ifdef RDEBUG
	freopen("sample.in","r",stdin);
	#endif
	read(n);TA.init(),TB.init();
	for(int i=1;i<=n;i++)if((TA.sonc[i]^TB.sonc[i])&1) return puts("IMPOSSIBLE"),0;
	puts("POSSIBLE");
	TA.work(),TB.work();
	for(int i=1;i<=n;i++)if(!(TA.sonc[i]&1)&&!col[i]) paint(i);
	for(int i=1;i<=n;i++) printf("%d ",(TA.sonc[i]&1)?(0):(col[i]));putchar('\n');
	return 0;
}
}
int main(){return RKK::main();}