#include<functional>
#include<algorithm>
#include<iterator>
#include<cstring>
#include<cstdio>
using namespace std;
void GG()
{
	puts("IMPOSSIBLE");
	exit(0);
}
int da[111111],db[111111],pa[111111],pb[111111];
int n;
struct R{int v,z;}e[1111111];
int K[222222],cur[222222],ce=1;
void ins(int a,int b){e[++ce]=(R){b,K[a]};K[a]=ce;}
int viz[1111111],res[111111];
const int s=0;
int d;
void dfs(int u)
{
	++d;
	for(int&i=cur[u];i;i=e[i].z)if(!viz[i])
	{
		viz[i]=1;
		viz[i^1]=-1;
		dfs(e[i].v);
	}
}
void euler()
{
	memcpy(cur,K,sizeof(cur));
	dfs(s);
	puts("POSSIBLE");
	for(int u=1;u<=n;++u)
	{
		int a=0;
		for(int i=K[u];i;i=e[i].z)
		{
			if(e[i].v==pa[u])
				res[u]+=viz[i],
				res[pa[u]]-=viz[i];
		}
	}
	for(int i=1;i<=n;++i)printf("%d ",res[i]);
}
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;++i)
	{
		scanf("%d",&pa[i]);
		if(pa[i]==-1)pa[i]=s;
		ins(pa[i],i),ins(i,pa[i]);
		++da[pa[i]];
	}
	for(int i=1;i<=n;++i)
	{
		scanf("%d",&pb[i]);
		if(pb[i]==-1)pb[i]=s;
		ins(pb[i]+n+1,i+n+1),ins(i+n+1,pb[i]+n+1);
		++db[pb[i]];
	}
	ins(s,s+n+1);
	ins(s+n+1,s);
	for(int i=1;i<=n;++i)
	{
		if((da[i]&1)!=(db[i]&1))
			GG();
		#define gmin(a,b) ((a)<(b)?(a):(b))
		int z=gmin(da[i],db[i])+1;
		for(int j=1;j<=z;++j)ins(i,i+n+1),ins(i+n+1,i);
	}
	euler();
	return 0;
}