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 PB push_back
using namespace std;
const int N=200005,M=600005;
int n,rt1,rt2,sz[N],bo[M],re[N],ct=0,vis[N];
struct rec{int to,id;};
vector<rec>e[M];
inline void dfs(int x,int fa)
{
	int i,yy; for(i=0;i<e[x].size();i++){yy=e[x][i].to; if(yy==fa)continue; dfs(yy,x); sz[x]++;}
}
inline void sol(int x)
{
	int i; rec tmp;
	for(i=vis[x];i<e[x].size();i=vis[x])
	{
		tmp=e[x][i]; vis[x]=i+1; if(bo[tmp.id])continue; bo[tmp.id]=1; if(tmp.to==x-n)re[tmp.to]=-1;else if(tmp.to==x+n)re[x]=1; sol(tmp.to);
	}
}
int main()
{
	int i,x; scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&x); if(x==-1)rt1=i; else {e[i].PB((rec){x,++ct}); e[x].PB((rec){i,ct});}
	}dfs(rt1,0);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&x); if(x==-1)rt2=i; else {e[i+n].PB((rec){x+n,++ct}); e[x+n].PB((rec){i+n,ct});}
	}dfs(rt2+n,0);
	for(i=1;i<=n;i++)
	{
		if((sz[i]&1)^(sz[i+n]&1))return 0*printf("IMPOSSIBLE\n"); if(!(sz[i]&1)){e[i].PB((rec){i+n,++ct});e[i+n].PB((rec){i,ct});}
	}e[rt1].PB((rec){2*n+1,++ct}); e[2*n+1].PB((rec){rt1,ct}); e[rt2+n].PB((rec){n*2+1,++ct}); e[n*2+1].PB((rec){rt2+n,ct});
	sol(n*2+1); printf("POSSIBLE\n"); for(i=1;i<=n;i++)printf("%d ",re[i]);
}