#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];

int main(){	
//	freopen("test.in","r",stdin);
	scanf("%d",&n);
	int c0 = 0;
	rep(i,1,n){
		scanf("%d",&a[i]);
		if(a[i] == 1) c0++;
	}
	rep(i,1,n){
		scanf("%d",&b[i]);
		if(b[i] == 1) c0--;
	}
	if(c0){
		printf("-1\n");
		return 0;
	}
	int fail = 0;
	rep(i,1,n) if(a[i] != b[n + 1 - i]) fail = 1;
	if(!fail){
		printf("1\n");
		rep(i,1,n) printf("1%c"," \n"[i == n]);
		rep(i,1,n) printf("1%c"," \n"[i == n]);
		return 0;		
	}

	printf("2\n");
	rep(i,1,n) printf("%d%c",a[i]," \n"[i == n]);
	rep(i,1,n) printf("%d%c",b[i]," \n"[i == n]);	
	return 0;
}