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 <algorithm>
#include <iostream>
#include <vector>
using namespace std;

const int MAXN = 1e5 + 5;

int N;
int root[2];
int res[MAXN];
int match[2][MAXN];
int parity[2][MAXN];
vector <int> 	Adj[2][MAXN];
vector <int> newAdj[2][MAXN];

int curG;

void DFS(int cur)
{
	for(auto x : Adj[curG][cur])
	{
		DFS(x);
		newAdj[curG][cur].push_back(newAdj[curG][x].front());
	}
	while(newAdj[curG][cur].size() > 1)
	{
		int u = newAdj[curG][cur].back();
		newAdj[curG][cur].pop_back();
		int v = newAdj[curG][cur].back();
		newAdj[curG][cur].pop_back();
		match[curG][u] = v;
		match[curG][v] = u;
	}
	if(newAdj[curG][cur].empty())
		parity[curG][cur] = 1, newAdj[curG][cur].push_back(cur);
}

void getRes(int cur)
{
	for(int G = 0; G < 2; G++)
	{
		int to = match[G][cur];
		if(to != 0 && res[to] == 0)
			res[to] = -res[cur], getRes(to);
	}
}

int main(int argc, char **argv)
{
	cin >> N ;
	for(curG = 0; curG < 2; curG++)
	{
		for(int i = 1; i <= N; i++)
		{
			int fa;
			cin >> fa;
			if(fa == -1)
				root[curG] = i;
			else
				Adj[curG][fa].push_back(i);
		}
		DFS(root[curG]);
	}

	for(int i = 1; i <= N; i++)
		if(parity[0][i] != parity[1][i])
		{
			cout << "IMPOSSIBLE" << endl ;
			return 0;
		}

	for(int i = 1; i <= N; i++)
	{
		if(parity[0][i] == 0 || (parity[0][i] == 1 && res[i]))
			continue;
		res[i] = 1;
		getRes(i);
	}

	cout << "POSSIBLE" << endl ;
	for(int i = 1; i <= N; i++)
		cout << res[i] << " ";
	cout << endl ;
}

