#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
#define N 400005
#define M 900005
using namespace std;
int d1[N],d2[N],f1[N],f2[N],n,m,ans[N],fs[M],nt[M],dt[M],lt[M],sd[M],fx[M];
void link(int x,int y)
{
	lt[fs[x]]=++m;
	nt[m]=fs[x];
	dt[fs[x]=m]=y;
}
void lk(int x,int y)
{
	link(x,y),link(y,x),fx[m]=m-1,fx[m-1]=m;
}
void dfs(int k)
{
	for(int i=fs[k];i;i=fs[k])
	{
		int p=dt[i];
		fs[k]=nt[i],lt[fs[k]]=0;
		lt[nt[fx[i]]]=lt[fx[i]];
		nt[lt[fx[i]]]=nt[fx[i]];
		if(fs[p]==fx[i]) fs[p]=nt[fx[i]];
		dfs(p);
	}
	sd[++sd[0]]=k;
}
int main()
{
	cin>>n;
	int r=0;
	fo(i,1,n)
	{
		scanf("%d",&f1[i]);
		if(f1[i]!=-1) d1[f1[i]]++,lk(i,f1[i]);
		else r=i;
	}
	lk(0,r);
	fo(i,1,n)
	{
		scanf("%d",&f2[i]);
		if(f2[i]!=-1) d2[f2[i]]++,lk(i+n,f2[i]+n);
		else lk(0,i+n);
	}
	fo(i,1,n)
	{
		if(d1[i]%2!=d2[i]%2) {printf("IMPOSSIBLE\n");return 0;}
		else if(d1[i]%2==0) lk(i,i+n);
	}

	printf("POSSIBLE\n");
	dfs(1);
	fod(i,sd[0],2) 
	{
		if(sd[i]==0||sd[i-1]==0) continue;
		if(sd[i]==sd[i-1]-n) ans[sd[i]]=-1;
		if(sd[i]==sd[i-1]+n) ans[sd[i-1]]=1;
	}
	fo(i,1,n) 
	{
		printf("%d ",ans[i]);
	} 
}