#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/priority_queue.hpp>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MP make_pair
#define pii pair<int,int>
const double PI=acos(-1.0);
template <class Miaowu>
inline void in(Miaowu &x){
	char c;x=0;bool f=0;
	for(c=getchar();c<'0'||c>'9';c=getchar())f|=c=='-';
	for(;c>='0'&&c<='9';c=getchar())x=(x<<1)+(x<<3)+(c^48);
	x=f?-x:x;
}
const int N=1e6+5;
int n,a[N],b[N],ca[N],cb[N],id[N],bel[N],now[N];
struct SGT{
	int t[N<<2];
	inline int ls(int u){return u<<1;}
	inline int rs(int u){return u<<1|1;}
	inline void pu(int u){
		if(!t[rs(u)])t[u]=t[ls(u)];
		else t[u]=t[rs(u)];
	}
	inline void upd(int u,int l,int r,int p,int x){
		if(l==r)return t[u]=x,void();
		int mid=l+r>>1;
		mid>=p?upd(ls(u),l,mid,p,x):upd(rs(u),mid+1,r,p,x);
		pu(u);
	}
	inline int binary(int u,int l,int r,int L,int R){
		if(l==r)return t[u];
		int mid=l+r>>1;
		if(l>=L&&r<=R){
			if(t[rs(u)])return binary(rs(u),mid+1,r,L,R);
			return binary(ls(u),l,mid,L,R);
		}
		if(mid>=R)return binary(ls(u),l,mid,L,R);
		if(mid<L)return binary(rs(u),mid+1,r,L,R);
		int qwq=binary(rs(u),mid+1,r,L,R);
		return qwq?qwq:binary(ls(u),l,mid,L,R);
	}
}sgt;
int main(){
	in(n);
	for(int i=1;i<=n;i++)in(a[i]),ca[a[i]]++;
	for(int i=1;i<=n;i++)in(b[i]),cb[b[i]]++;
	for(int i=1;i<=1e6;i++)if(ca[i]!=cb[i])return puts("-1"),0;
	if(ca[1]+ca[2]==n){
		int flag=1;
		for(int i=1;i<=n;i++){
			if(a[i]!=b[n-i+1]){
				flag=2;break;
			}
		}
		cout<<flag<<endl;
		if(flag==1){
			for(int i=1;i<n;i++){
				printf("1 ");
			}
			puts("1");
			for(int i=1;i<n;i++){
				printf("1 ");
			}
			puts("1");
		}
		else{
			for(int i=1;i<n;i++){
				printf("%d ",a[i]);
			}
			cout<<a[n]<<endl;
			for(int i=1;i<n;i++){
				printf("%d ",b[i]);
			}
			cout<<b[n]<<endl;
		}
		return 0;
	}
	for(int i=1;i<=n;i++)
		id[a[i]]=i;
	reverse(b+1,b+n+1);
	for(int i=1;i<=n;i++)
		b[i]=id[b[i]];
	int ans=0;
	for(int i=1;i<=n;i++){
		int qwq=sgt.binary(1,1,n,1,b[i]-1);
		if(!qwq){
			ans++,bel[i]=ans,now[ans]=b[i];
			sgt.upd(1,1,n,b[i],ans);
		}
		else{
			sgt.upd(1,1,n,now[qwq],0);
			now[qwq]=b[i],bel[i]=qwq;
			sgt.upd(1,1,n,b[i],ans);
		}
	}
	cout<<ans<<endl;
	for(int i=1;i<n;i++)
		printf("%d ",bel[i]);
	cout<<bel[n]<<endl;
	reverse(b+1,b+n+1);
	for(int i=1;i<n;i++)
		printf("%d ",bel[b[i]]);
	cout<<bel[b[n]]<<endl;
	return 0;
}