#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    vector<int> a(n), b(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    for (int i = 0; i < n; ++i) {
        cin >> b[i];
    }

    if (*max_element(a.begin(), a.end()) <= 2) {
        reverse(a.begin(), a.end());
        if (a == b) {
            cout << "1\n";
            for (int t = 0; t < 2; ++t) {
                for (int i = 0; i < n; ++i) {
                    cout << 1 << " \n"[i == n - 1];
                }
            }
            return 0;
        } else {
            reverse(a.begin(), a.end());
            int c = count(a.begin(), a.end(), 1);
            if (c == count(b.begin(), b.end(), 1) && n - c == count(b.begin(), b.end(), 2)) {
                cout << "2\n";
                for (int i = 0; i < n; ++i) {
                    cout << a[i] << " \n"[i == n - 1];
                }
                for (int i = 0; i < n; ++i) {
                    cout << b[i] << " \n"[i == n - 1];
                }
            } else {
                cout << "-1\n";
            }
            return 0;
        }
    }

    vector<int> pos(n, -1);
    for (int i = 0; i < n; ++i) {
        pos[--a[i]] = i;
    }

    vector<int> t(n);
    for (int i = 0; i < n; ++i) {
        t[i] = pos[--b[i]];
        if (t[i] == -1) {
            cout << "-1\n";
            return 0;
        }
    }

    vector<int> stk(n, -1);
    set<int> s;
    for (int i = 0; i < n; ++i) {
        auto it = s.lower_bound(t[i]);
        if (it == s.end()) {
            stk[t[i]] = s.size();
        } else {
            stk[t[i]] = stk[*it];
            s.erase(it);
        }
        s.insert(t[i]);
    }

    cout << s.size() << '\n';
    for (int i = 0; i < n; ++i) {
        cout << stk[i] + 1 << " \n"[i == n - 1];
    }
    for (int i = 0; i < n; ++i) {
        cout << stk[t[i]] + 1 << " \n"[i == n - 1];
    }

    return 0;
}