#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define llu unsigned long long
#define ld double
#define llu unsigned long long
#define rep(i,x,y)  for(int i=int(x);i<int(y);++i)
#define For(i,x,y)  for(int i=int(x);i<=int(y);++i)
#define FOr(i,x,y)  for(int i=int(x);i>=int(y);--i)
#define pi acos(-1) 
#define mk make_pair
#define pa pair<ll,ll>
#define lf else if
#define IL inline
#define max(x,y)    ((x)<(y)?(y):(x))
#define min(x,y)    ((x)<(y)?(x):(y))
#define sqr(x)      ((x)*(x))
#define Mul(x,y)    ((x)=1LL*(x)*(y)%mod)
#define Add(x,y)    ((x)=((x)+(y))%mod)
#define Max(x,y)    ((x)=((x)<(y)?(y):(x)))
#define Min(x,y)    ((x)=((x)>(y)?(y):(x)))
#define E(x)        return writeln(x),0
#define LL			(long long)
#define p(x)        printf("~%lld~\n",LL(x))
#define pp(x,y)     printf("~~%lld %lld~~\n",LL(x),LL(y))
#define ppp(x,y,z)  printf("~~~%lld %lld %lld~~~\n",LL(x),LL(y),LL(z))
#define pppp(a,b,c,d)	printf("~~~%lld %lld %lld %lld\n",LL(a),LL(b),LL(c),LL(d))
#define f_in(x)     freopen(x".in","r",stdin)
#define f_out(x)    freopen(x".out","w",stdout)
#define open(x)     f_in(x),f_out(x)
#define fi first
#define se second
#define GuYue		puts("\nGuYueNa________________________________________________________________________________")
typedef complex<double> E;
namespace SHENZHEBEI{
#ifdef LOCAL
    struct _{_(){freopen("cf.in","r",stdin);}}_; 
#endif 
#define NEG 1
    static const int GYN=2333333;
    char SZB[GYN],*SS=SZB,*TT=SZB;
    inline char gc(){   if (SS==TT){  TT=(SS=SZB)+fread(SZB,1,GYN,stdin); if (SS==TT) return '\n';  }   return *SS++;    }
#if NEG
    inline ll read(){    ll x=0,g=1; char ch=gc();   for (;!isdigit(ch);ch=gc()) if (ch=='-') g=-1;  for (;isdigit(ch);ch=gc())  x=x*10-48+ch;   return x*g; }
    inline void write(ll x){    if (x<0) putchar('-'),x=-x;  if (x>=10)   write(x/10);    putchar(x%10+'0');  }
#else
    inline ll read(){    ll x=0; char ch=gc();   for (;!isdigit(ch);ch=gc());    for (;isdigit(ch);ch=gc())  x=x*10-48+ch;   return x;   }
    inline void write(ll x){    if (x>=10)   write(x/10);    putchar(x%10+'0');  }
#endif
    inline char readchar(){ char ch=gc();   for(;isspace(ch);ch=gc());  return ch;  }
    inline ll readstr(char *s){ char ch=gc();   int cur=0;  for(;isspace(ch);ch=gc());      for(;!isspace(ch);ch=gc())  s[cur++]=ch;    s[cur]='\0';    return cur; }
	void Print(long long *a,int s,int t){For(i,s,t)printf("%lld ",a[i]);}
	void Print(int *a,int s,int t){For(i,s,t)printf("%d ",a[i]);}
	void Print(char *a,int s,int t){For(i,s,t)putchar(a[i]);}
	void writeln(ll x){write(x);puts("");}
}using namespace SHENZHEBEI;
const ll N=1000010;
vector<ll>g[2][N];
ll vis[N],tot=1,fa[2][N],sum[2][N],rt[2],n,head[N],nxt[N],vet[N],ans[N];
void dfs(ll x,ll tp){
	sum[tp][x]=1;
	rep(i,0,g[tp][x].size()){
		dfs(g[tp][x][i],tp);
		sum[tp][x]^=1;
	}
}
void insert(ll x,ll y){nxt[++tot]=head[x];head[x]=tot;vet[tot]=y;}
void AddEdge(ll x,ll y){insert(x,y);insert(y,x);}
void dfs(ll x){
	for(;head[x];){
		ll i=head[x];
		head[x]=nxt[i];
		if (vis[i])continue;
		vis[i]=vis[i^1]=1;
		if (x&&vet[i]==x+n)		ans[x]=-1;
		lf (x-n&&vet[i]==x-n)	ans[x-n]=1;
		dfs(vet[i]);
	}
}
int main(){
	n=read();
	For(i,1,n)fa[0][i]=read(),rt[0]=fa[0][i]==-1?i:rt[0],g[0][fa[0][i]].push_back(i);
	For(i,1,n)fa[1][i]=read(),rt[1]=fa[1][i]==-1?i:rt[1],g[1][fa[1][i]].push_back(i);
	dfs(rt[0],0);dfs(rt[1],1);
	For(i,1,n)if (sum[0][i]^sum[1][i])return puts("IMPOSSIBLE"),0;
	puts("POSSIBLE");
	For(i,1,n)if (~fa[0][i])AddEdge(fa[0][i],i);else	AddEdge(0,i);
	For(i,1,n)if (~fa[1][i])AddEdge(fa[1][i]+n,i+n);else	AddEdge(0,i+n);
	For(i,1,n)if (sum[0][i])AddEdge(i,i+n);
	dfs(0);
	For(i,1,n)write(ans[i]),putchar(' ');
}
/*
4---5
|
|
3---2
|
|
1
每个子树中。。
*/

Measured memory_bytes: 93684