#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>

using namespace std;
using vi = vector<int>;
using vpi = vector<pair<int, int>>;

int main() {
    int n; cin >> n;
    vi a(n);
    vi b(n);
    vi aplace(n+1);
    vi bplace(n+1);
    vpi shit;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        aplace[a[i]] = i;
    }
    for (int i = 0; i < n; i++) {
        cin >> b[i];
        bplace[b[i]] = i;
        shit.push_back({i, b[i]});
    }
    // for (int i = 1; i <= n; i++) {
    //     cout << aplace[i] << ' ';
    // }
    // cout << endl;
    // for (int i = 1; i <= n; i++) {
    //     cout << bplace[i] << ' ';
    // }
    // cout << endl;
    sort(shit.begin(), shit.end(), greater<>());
    for (int i = 1; i < n; i++) {
        if (((aplace[i] - aplace[i+1])*(bplace[i] - bplace[i+1])) < 0) {
            // opposite order
            cout << -1 << endl;
            return 0;
        }
    }
    // can be done
    // what goes in last place?
    // just order by descending last position
    vi ans;
    for (int i = 0; i < n; i++) {
        int x = shit[i].second;
        int idx = 0;
        for (; idx < n; idx++) {
            if (a[idx] == x) break;
        }
        while (idx < bplace[x]) {
            ans.push_back(idx);
            assert(idx < n);
            assert(abs(a[idx] - a[idx+1]) >= 2);
            swap(a[idx], a[idx+1]);
            idx++;
        }
        while (idx > bplace[x]) {
            assert(idx > 0);
            assert(abs(a[idx] - a[idx-1]) >= 2);
            ans.push_back(idx-1);
            swap(a[idx], a[idx-1]);
            idx--;
        }

    }
    cout << ans.size() << endl;
    for (int x : ans) cout << x+1 << ' ';
    if (ans.size()) cout << endl;
}