#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair <int, int> pii;

const int N = 1e5 + 5, inf = 1e9;

int n, deg[N][2], num, root, col[N];
bool vis[N];
vector <int> adj[N], g[N];

void reset() {
	for (int i = 0; i < n; i++)
		adj[i].clear();
	num++;
}

int dfs_1(int v) {
	vector <int> uno;
	if((deg[v][0] % 2 == 0))
		uno.push_back(v);
	for (auto e : adj[v]) {
		int u = dfs_1(e);
		if(u != inf)
			uno.push_back(u);
	}
	int sz = uno.size();
	while(sz > 1) {
		int x = uno[sz - 1], y = uno[sz - 2];
		uno.pop_back();
		uno.pop_back();
		g[x].push_back(y);
		g[y].push_back(x);
		sz -= 2;
	}
	if(sz)
		return uno[0];
	else
		return inf;
}

void dfs_2(int v) {
	vis[v] = 1;
	for (auto u : g[v]) {
		if(!vis[u]) {
			col[u] = col[v] * -1;
			dfs_2(u);
		}
	}
}

void build() {
	for (int i = 0; i < n; i++) {
		int par;
		cin >> par;
		par--;
		if(par == -2)
			root = i;
		else
			adj[par].push_back(i), deg[par][num]++;
	}
	if(num) {
		for (int i = 0; i < n; i++) {
			if((deg[i][0] & 1) != (deg[i][1] & 1)) {
				cout << "IMPOSSIBLE\n";
				exit(0);
			}
			deg[i][0] &= 1;
		}
	}
	dfs_1(root);
	reset();
}

int main() {
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);	
	cin >> n;
	build();
	build();
	for (int i = 0; i < n; i++) {
		deg[i][0] &= 1;
		if(!deg[i][0] && !vis[i]) {
			col[i] = 1;
			dfs_2(i);
		}
	}
	cout << "POSSIBLE\n";
	for (int i = 0; i < n; i++)
		cout << col[i] << " ";
	cout << "\n";
}
