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 <iostream>
#include <cstdio>
#define il inline
#define ri register
#define Size 600050
using namespace std;
namespace{
	template<class free>
		il void read(free&x){
		x^=x;ri char c;while(c=getchar(),c==' '||c=='\n'||c=='\r');
		ri bool check(false);if(c=='-')check=true,c=getchar();
		while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
		if(check)x=~x+1;
	}
	template<class f1,class...f2>
		il void read(f1&x,f2&...y){
		read(x),read(y...);
	}
}
struct point{
	int next,to;
}ar[Size];
bool is[Size];
int head[Size],art(1);
int son[2][Size],rt[2],a[Size];
il void link(int,int),dfs(int);
int main(){
	int n;read(n);
	for(int i(1),j;i<=n;++i)
		read(j),~j?link(j,i),
			++son[0][j]:rt[0]=i;
	for(int i(1),j;i<=n;++i)
		read(j),~j?link(j+n,i+n),
			++son[1][j]:rt[1]=i+n;
	link(rt[0],rt[1]);
	for(int i(1);i<=n;++i){
		if(son[0][i]+son[1][i]&1)
			return puts("IMPOSSIBLE"),0;
		if(~son[0][i]&1)link(i,i+n),a[i]=art;
	}dfs(1),puts("POSSIBLE");
	for(int i(1);i<=n;++i)
		if(son[0][i]&1)puts("0");
		else puts(is[a[i]]?"-1":"1");
	return 0;
}
il void dfs(int x){
	for(int i(head[x]);i;i=head[x])
		if(head[x]=ar[head[x]].next,!is[i])
			is[i^1]=1,dfs(ar[i].to);
}
il void link(int u,int v){
	ar[++art]={head[u],v},head[u]=art;
	ar[++art]={head[v],u},head[v]=art;
}
