#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 1e6 + 100, M = 4096 + 10, len = 21, inf = 1e18;
const ll mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll um(ll a, ll b){
	return (1LL * a * b) % mod;
}
ll subr(ll a, ll b){
	return ((1LL * a - b) % mod + mod) % mod;
}
int a[N], c[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int n, ones = 0, zero = 0;
  cin >> n;
  for(int i = 1; i <= n; i++){
  	cin >> a[i];
  	if(a[i] == 1) ones++;
  	else zero++;
  }
  bool can = true;
  for(int i = 1; i <= n; i++){
  	cin >> c[i];
  	if(c[i] == 1) ones--;
  	else zero--;
  	if(c[i] != a[n - i + 1]) can = false;
  }
  if(ones < 0 || zero < 0){
  	cout << -1;
  	return 0;
  }
  if(can){
  	cout << 1 << endl;
  	for(int i = 1; i <= n; i++){
  		cout << 1;
  		if(i != n) cout << " ";
  	}
  	cout << endl;
  	for(int i = 1; i <= n; i++){
  		cout << 1;
  		if(i != n) cout << " ";
  	}
  } else{
  	cout << 2 << endl;
  	for(int i = 1; i <= n; i++){
  		cout << a[i];
  		if(i != n) cout << " ";
  	}
  	cout << endl;
  	for(int i = 1; i <= n; i++){
  		cout << c[i];
  		if(i != n) cout << " ";
  	}
  }
  return 0;
}