#include <bits/stdc++.h>

using namespace std;

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector<int> b(n);
    for (int i = 0; i < n; ++i) {
        cin >> b[i];
    }
    vector<int> aa = a, bb = b;
    sort(aa.begin(), aa.end());
    sort(bb.begin(), bb.end());
    if (aa != bb) {
        cout << -1 << '\n';
        return;
    }
    reverse(a.begin(), a.end());
    if (a == b) {
        cout << 1 << '\n';
        for (int i = 0; i < n; ++i) {
            cout << 1 << " \n"[i == n - 1];
        }
        for (int i = 0; i < n; ++i) {
            cout << 1 << " \n"[i == n - 1];
        }
    } else {
        reverse(a.begin(), a.end());
        cout << 2 << '\n';
        for (int i = 0; i < n; ++i) {
            if (a[i] == a[0]) {
                cout << 1 << " \n"[i == n - 1];
            } else {
                cout << 2 << " \n"[i == n - 1];
            }
        }
        for (int i = 0; i < n; ++i) {
            if (b[i] == a[0]) {
                cout << 1 << " \n"[i == n - 1];
            } else {
                cout << 2 << " \n"[i == n - 1];
            }
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}