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> 
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fd(i,a,b) for(i=a;i>=b;i--)
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
typedef long long ll;
using namespace std;
inline int read(){
	int n=0,f=1;char c;
	for(c=getchar();(c<'0'||c>'9')&&c!='-';c=getchar());
	if (c=='-') c=getchar(),f=-1;
	for(;c>='0'&&c<='9';c=getchar()) n=n*10+c-48;
	return n*f;
}
const int maxn=1e6+5;
int k[maxn],ne[maxn],g[maxn],num;
int f[maxn],i,n,ro1,ro2,x[maxn];
int q[maxn],cnt;
bool bz[maxn],bk[maxn];
void add(int x,int y){
	ne[++num]=k[x],k[x]=num,g[num]=y;
	ne[++num]=k[y],k[y]=num,g[num]=x;
}
void dfs(int x){
	for(int i=k[x];i;i=k[x]){
		k[x]=ne[i];
		if (bk[i]) continue;
		bk[i^1]=1,dfs(g[i]);
	}q[++cnt]=x;
}
int main(){
	n=read();
	num=1;
	fo(i,1,n) {
		f[i]=read();
		if (f[i]!=-1) add(f[i],i),bz[f[i]]^=1,bz[i]^=1;
		else bz[ro1=i]^=1;
	}
	fo(i,1,n) {
		f[n+i]=read();
		if (f[n+i]!=-1) f[n+i]+=n,add(f[n+i],n+i),bz[f[n+i]]^=1,bz[n+i]^=1;
		else bz[ro2=n+i]^=1;
	}
	fo(i,1,n) if (bz[i]^bz[n+i]) return puts("IMPOSSIBLE"),0;
	puts("POSSIBLE");
	fo(i,1,n) if (bz[i]) add(i,i+n);
	int ro=n<<1|1; 
	add(ro,ro1),add(ro,ro2);
	dfs(ro);
	fo(i,1,cnt-1)if (q[i]-q[i+1]==n) x[q[i+1]]=-1;
	fo(i,1,n) {
		if (!x[i]&&bz[i]) x[i]=1;
		printf("%d ",x[i]);
	}
}