//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void solve() {
        ll n;
        cin >> n;
        multiset<ll> all;
        vector<ll> arr(n), need(n);
        bool b = true;
        for (ll i = 0; i < n; i++) {
                cin >> arr[i];
                if (arr[i] > 2) {
                        b = false;
                }
        }
        for (ll i = 0; i < n; i++) {
                cin >> need[i];
                if (need[i] > 2) {
                        b = false;
                }
        }
        vector<ll> f = arr, s = need;
        sort(f.begin(), f.end());
        sort(s.begin(), s.end());
        if (f != s) {
                cout << -1;
                return;
        }
        if (b) {
                reverse(arr.begin(), arr.end());
                if (arr == need) {
                        cout << 1 << '\n';
                        for (ll i = 0; i < n; i++) {
                                cout << 1;
                                if (i != n - 1) {
                                        cout << ' ';
                                }
                        }
                        cout << '\n';
                        for (ll i = 0; i < n; i++) {
                                cout << 1;
                                if (i != n - 1) {
                                        cout << ' ';
                                }
                        }
                        cout << '\n';
                } else {
                        reverse(arr.begin(), arr.end());
                        cout << 2 << '\n';
                        for (ll i = 0; i < n; i++) {
                                cout << arr[i];
                                if (i != n - 1) {
                                        cout << ' ';
                                }
                        }
                        cout << '\n';
                        for (ll i = 0; i < n; i++) {
                                cout << need[i];
                                if (i != n - 1) {
                                        cout << ' ';
                                }
                        }
                        cout << '\n';
                }
        } else {
                vector<vector<ll>> alla(n + 1);
                for (ll i = 0; i < n; i++) {
                        alla[arr[i]].push_back(i);
                }
                for (ll i = 1; i <= n; i++) {
                        reverse(alla[i].begin(), alla[i].end());
                }
                vector<ll> wp(n + 1);
                for (ll i = 0; i < n; i++) {
                        wp[alla[need[i]].back()] = i;
                        alla[need[i]].pop_back();
                }
                set<ll> all;
                vector<ll> num(n + 1);
                ll lst = 1;
                vector<ll> ans(n + 1);
                for (ll i = 0; i < n; i++) {
                        auto it = all.lower_bound(wp[arr[i]]);
                        if (it == all.end()) {
                                num[wp[arr[i]]] = lst;
                                ans[i] = lst;
                                all.insert(wp[arr[i]]);
                                lst++;
                        } else {
                                num[wp[arr[i]]] = num[*it];
                                ans[i] = num[*it];
                                all.erase(it);
                                all.insert(wp[arr[i]]);
                        }
                }
                cout << all.size() << '\n';
                for (ll i = 0; i < n; i++) {
                        cout << ans[i];
                        if (i != n - 1) {
                                cout << ' ';
                        }
                }
                cout << '\n';
                for (ll i = 0; i < n; i++) {
                        cout << num[i];
                        if (i != n - 1) {
                                cout << ' ';
                        }
                }
                cout << '\n';
        }
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}