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;
const int N=1e6+5;
int n,hd[N],to[N],nx[N],du[N],tt;
void add(int u,int v){ //cout<<"add:"<<u<<" "<<v<<endl;
	nx[++tt]=hd[u]; to[hd[u]=tt]=v; du[v]++;
	nx[++tt]=hd[v]; to[hd[v]=tt]=u; du[u]++;
}
vector<int>h[N];
int pt[N],is[N];
void dfs(int u,int fa){ //cout<<u<<" "<<fa<<endl;
	int z=h[u].size(); pt[u]=0;
	for(int i=0;i<z;i++){
		int v=h[u][i]; if(v==fa) continue;
		dfs(v,u);
		if(pt[u]) add(pt[u],pt[v]),pt[u]=0;
		else pt[u]=pt[v];
	}
	if(!pt[u]) pt[u]=u;  
	if(!is[u]) is[u]=-1+(pt[u]==u)*2;
	else if((is[u]==1 && pt[u]!=u) || (is[u]==-1 && pt[u]==u)){
		//puts("-1");
		puts("IMPOSSIBLE");
		exit(0);
	}
}
int ans[N];
void work(){
	int rt=0;
	for(int i=1;i<=n;i++) h[i].clear();
	for(int x,i=1;i<=n;i++){
		scanf("%d",&x);
		if(~x) h[x].push_back(i),h[i].push_back(x);
		else rt=i;
	}
	dfs(rt,0);
	//if(!ans[pt[rt]]) ans[pt[rt]]=1;
	//else ans[pt[rt]]=-1;
	//puts("");
	//cout<<1<<endl;
}
void clr(int u){
	for(int e=hd[u];e;e=nx[e]){
		int v=to[e]; if(ans[v]) continue;
		ans[v]=-ans[u]; clr(v);
	}
}
int main()
{
	srand(time(0));
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin>>n;
	for(int p=0;p<2;p++) work();
	for(int i=1;i<=n;i++){
		if(~is[i] && !ans[i]) ans[i]=1;
		if(du[i]) clr(i);
	}
	puts("POSSIBLE");
	for(int i=1;i<=n;i++) printf("%d ",ans[i]); puts("");
	return 0;
}
