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>
#include <cstring>
#include <algorithm>
 
using namespace std;
typedef long long LL;
const int N = 600050;
 
int head[N], to[N], nex[N], tot = 1, vis[N], ans[N], oe[N], oe2[N], n;
void addedge(int u, int v){
	tot ++; to[tot] = v, nex[tot] = head[u], head[u] = tot;
	tot ++; to[tot] = u, nex[tot] = head[v], head[v] = tot;
}
void dfs(int x){
	for(int i = head[x]; i; i = head[x]){
		head[x] = nex[i];
		if(vis[i] == 0){
			vis[i] = 1;
			vis[i ^ 1] = 1;
			if(to[i] == x + n)
				ans[x] = 1;
			else if(to[i] == x - n)
				ans[x - n] = -1;
			dfs(to[i]);
		}
	}
}
	
int main()
{
 
	int i, j, k, ra, rb;
	scanf("%d", &n);
	for(i = 1; i <= n; i ++){
		scanf("%d", &j), oe[j] ^= 1;
		if(j != -1)addedge(i, j);
		else ra = i;
	}
	for(i = 1; i <= n; i ++){
		scanf("%d", &k), oe2[k] ^= 1;
		if(k != -1)addedge(i + n, k + n);
		else rb = i + n;
	}
	for(i = 1; i <= n; i ++){
		if(oe2[i] != oe[i]){
			puts("IMPOSSIBLE");
			return 0;
		}else if(oe[i] == 0)
			addedge(i, i + n); 
	}
	addedge(ra, 2 * n + 1);
	addedge(rb, 2 * n + 1);
	puts("POSSIBLE"), dfs(1);
	for(i = 1; i <= n; i ++)
		printf("%d ", ans[i]);
 
	return 0;
}