There are two rooted trees, each with N vertices. The vertices of each tree are numbered 1 through N. In the first tree, the parent of Vertex i is Vertex A_i. Here, A_i=-1 if Vertex i is the root of the first tree. In the second tree, the parent of Vertex i is Vertex B_i. Here, B_i=-1 if Vertex i is the root of the second tree.

Snuke would like to construct an integer sequence of length N, X_1 , X_2 , ... , X_N, that satisfies the following condition:

* For each vertex on each tree, let the indices of its descendants including itself be a_1 , a_2 , ..., a_k. Then, abs(X_{a_1} + X_{a_2} + ... + X_{a_k})=1 holds.



Determine whether it is possible to construct such a sequence. If the answer is possible, find one such sequence.

Constraints

* 1 \leq N \leq 10^5
* 1 \leq A_i \leq N, if Vertex i is not the root in the first tree.
* A_i = -1, if Vertex i is the root in the first tree.
* 1 \leq B_i \leq N, if Vertex i is not the root in the second tree.
* B_i = -1, if Vertex i is the root in the second tree.
* Input corresponds to valid rooted trees.

Input

Input is given from Standard Input in the following format:


N
A_1 A_2 .. A_N
B_1 B_2 .. B_N


Output

If it is not possible to construct an integer sequence that satisfies the condition, print `IMPOSSIBLE`. If it is possible, print `POSSIBLE` in the first line. Then, in the second line, print X_1 , X_2 , ... , X_N, an integer sequence that satisfies the condition.

Examples

Input

5
3 3 4 -1 4
4 4 1 -1 1


Output

POSSIBLE
1 -1 -1 3 -1


Input

6
-1 5 1 5 1 3
6 5 5 3 -1 3


Output

IMPOSSIBLE


Input

8
2 7 1 2 2 1 -1 4
4 -1 4 7 4 4 2 4


Output

POSSIBLE
1 2 -1 0 -1 1 0 -1
#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
inline int read()
{
  int p=0; int f=1; char ch=getchar();
  while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar();}
  while(ch>='0' && ch<='9'){p=p*10+ch-'0'; ch=getchar();}
  return p*f;
}

struct node{int x,y,next;}edge[N]; int len,first[N];
void ins(int x,int y)
{
  len++; edge[len].x=x; edge[len].y=y; edge[len].next=first[x]; first[x]=len;
  len++; edge[len].x=y; edge[len].y=x; edge[len].next=first[y]; first[y]=len;
}

int n,cnta[N],cntb[N]; int ans[N];

int s[N],top; bool vis[N];

void dfs(int x)
{
  while(1)
  {
    int k = first[x]; if(k==-1) break; first[x] = edge[k].next;
    int y = edge[k].y;
    if(!vis[k>>1])
    {
      vis[k>>1] = 1;
      dfs(y); s[++top] = k;
    }
  }
}

int main()
{

  len=1; memset(first,-1,sizeof(first)); n=read();
  for(int i=1;i<=n;i++){int x=read(); if(x==-1) x=0,ins(x,i); else{ins(x,i); cnta[x]++;}}
  for(int i=1;i<=n;i++){int x=read(); if(x==-1) x=0,ins(x,i+n); else{ins(x+n,i+n); cntb[x]++;}}
  for(int i=1;i<=n;i++)
  {
    ans[i] = -1; if((cnta[i]&1) != (cntb[i]&1)){printf("IMPOSSIBLE\n"); return 0;}
    if((cnta[i]&1) == 1 && (cntb[i]&1) == 1) ans[i] = 0;
    else ins(i,i+n);
  }

  printf("POSSIBLE\n");
  top=0; dfs(1);

  for(int i=top;i>=1;i--)
  {
    int k = s[i];
    if(edge[k].x >= 1 && edge[k].x <= n && edge[k].y <=2*n && edge[k].y >= n+1) ans[edge[k].x] = 1;
  }

  for(int i=1;i<=n;i++) printf("%d%c",ans[i]," \n"[i==n]);

  return 0;
}