#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n;
int a[1000005],b[1000005],occ[2][1000005],A[1000005];

void Set(int &x,int y){
	if(x){
		printf("-1\n");
		exit(0);
	}
	x = y;
}

int m;
int dp[1000005];
vector <int> sta[1000005];
void up(int x,int y){
	sta[x].eb(y);
}

void dwn(int x,int y){
	assert(!sta[x].empty() && sta[x].back() == y);
	sta[x].pop_back();
}

int main(){	
//	freopen("test.in","r",stdin);
	scanf("%d",&n);
	rep(i,1,n){
		scanf("%d",&a[i]);
		Set(occ[0][a[i]],i);
	}
	rep(i,1,n){
		scanf("%d",&b[i]);
		Set(occ[1][b[i]],i);
	}
	rep(i,1,n){
		A[i] = occ[1][a[i]];
	}
	rep(i,1,n){
		dp[i] = 1;
		rep(j,1,i - 1) if(A[j] < A[i]) chkmax(dp[i],dp[j] + 1);
		chkmax(m,dp[i]);
	}
	rep(i,1,n) up(dp[i],a[i]);
	rep(i,1,n) dwn(dp[occ[0][b[i]]],b[i]);

	printf("%d\n",m);
	rep(i,1,n){
		printf("%d",dp[i]);
		if(i < n) printf(" ");
		else printf("\n");
	}
	rep(i,1,n){
		printf("%d",dp[occ[0][b[i]]]);
		if(i < n) printf(" ");
		else printf("\n");
	}
	return 0;
}