#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];
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[i]){
				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;
	}
	return 0;
}