#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}


void solve() {
	int n; cin >> n;
	int root[2];
	vector<vector<int>> G[2];
	rep(i, 2) {
		G[i].resize(n);
		rep(j, n) {
			int p; cin >> p; p--;
			if (p >= 0)G[i][p].push_back(j);
			else root[i] = j;
		}
	}
	rep(i, n) {
		int x = G[0][i].size() + G[1][i].size();
		if (x % 2) {
			cout << "IMPOSSIBLE\n"; return;
		}
	}

	vector<int> ans(n, 0);
	vector<set<int>> chs[2];
	rep(i, 2) {
		chs[i].resize(n + 1);
		function<int(int)>dfs = [&](int id)->int {
			vector<int> vs;
			for (int to : G[i][id])vs.push_back(dfs(to));
			if (G[i][id].size() % 2) {
				rep(j, G[i][id].size() - 1) {
					chs[i][id].insert(vs[j]);
				}
				return vs.back();
			}
			else {
				rep(j, G[i][id].size()) {
					chs[i][id].insert(vs[j]);
				}
				return id;
			}
		};
		chs[i][n].insert(dfs(root[i]));
	}
	vector<int> loc[2];
	rep(i, 2)loc[i].resize(n);
	rep(i, 2) {
		rep(j, n + 1) {
			for (int v : chs[i][j]) {
				loc[i][v] = j;
				//cout << i << " " <<j<<" "<< v << "\n";
			}
		}
	}
	rep(i, n)rep(j, 2)assert(chs[j][i].size() % 2 == 0);
	int cur = n;
	while (cur >= 0) {
		if (chs[0][cur].empty())cur--;
		else {
			vector<int> ids;
			int s = *chs[0][cur].begin();
			ids.push_back(s);
			int cid = 0;
			while (true) {
				chs[cid][loc[cid][s]].erase(s);
				int tid = loc[cid ^ 1][s];
				chs[cid ^ 1][tid].erase(s);
				cid ^= 1;
				if (chs[cid][tid].empty())break;
				s = *chs[cid][tid].begin();
				ids.push_back(s);
			}
			if (cur < n)assert(ids.size() % 2 == 0);
			rep(j, ids.size()) {
				int val = 1; if (j % 2 == 0)val = -1;
				ans[ids[j]] = val;
			}
		}
	}

	vector<int> scores[2];
	rep(i, 2)scores[i].resize(n, 0);
	rep(i, 2) {
		function<void(int)> dfs = [&](int id) {
			scores[i][id] = ans[id];
			for (int to : G[i][id]) {
				dfs(to);
				scores[i][id] += scores[i][to];
			}
		};
		dfs(root[i]);
		rep(j, n) {
			//cout << i << " " << j << " " << scores[i][j] << "\n";
		}
		rep(j, n)assert(abs(scores[i][j]) == 1);
	}

	cout << "POSSIBLE\n";
	rep(i, n) {
		if (i > 0)cout << " ";
		cout << ans[i];
	}
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//cout << grandy(2, 3, false, false) << "\n";
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}


Measured memory_bytes: 37288