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 <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
typedef long long ll ;
#define rep(i, a, b) for (int i = a; i <= b; ++ i) 
const int N = 2e5 + 5, M = 3 * N ;
using namespace std ;

bool vis[M], f[M] ;
int n, e, ter[M], nxt[M], lnk[N], rec[M], sza[N], szb[N], pos[N] ;

void add(int x, int y) {
	ter[++ e] = y, nxt[e] = lnk[x], lnk[x] = e, rec[e] = e + 1 ;
	ter[++ e] = x, nxt[e] = lnk[y], lnk[y] = e, rec[e] = e - 1 ;
}

void dfs(int p) {
	for (int i = lnk[p] ; i; i = lnk[p]) if (vis[i]) {
		int u = ter[i] ;
		lnk[p] = nxt[i] ;
		vis[i] = vis[rec[i]] = false, f[i] = true ;
		dfs(u) ;
	} else lnk[p] = nxt[i] ;
}

int main() {
	scanf("%d", &n) ;
	int x ;
	rep(i, 1, n) {
		scanf("%d", &x) ;
		if (x == - 1) add(2 * n + 1, i) ; else
			add(x, i), ++ sza[x] ;
	}
	rep(i, 1, n) {
		scanf("%d", &x) ;
		if (x == - 1) add(2 * n + 1, n + i) ; else
			add(x + n, i + n), ++ szb[x] ;
	}
	rep(i, 1, n) if ((sza[i] & 1) != (szb[i] & 1)) {
		puts("IMPOSSIBLE") ;
		return 0 ; 
	}
	rep(i, 1, n) if (sza[i] & 1) ; else add(i, i + n), pos[i] = e ;
	puts("POSSIBLE") ;
	rep(i, 1, e) vis[i] = true ;
	dfs(2 * n + 1) ;
	rep(i, 1, n) if (sza[i] & 1) printf("0 ") ; else {
		if (f[pos[i]]) printf("1 ") ; else printf("-1 ") ;
	}
	puts("") ;
	return 0 ;
}