#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100 + 5;

int N, a[MAX_N], b[MAX_N], posa[MAX_N], posb[MAX_N], c[MAX_N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
    cin >> N;
    for (int i = 1; i <= N; i ++) {
        cin >> a[i];
        posa[a[i]] = i;
    }
    for (int i = 1; i <= N; i ++) {
        cin >> b[i];
        posb[b[i]] = i;
    }
    for (int i = 1; i < N; i ++) {
        if ((posa[i] < posa[i + 1]) ^ (posb[i] < posb[i + 1])) {
            cout << "-1\n"; return 0;
        }
    }
    vector <int> opt(0);
    for (int i = 1; i <= N; i ++) {
        c[i] = posb[a[i]];
        // fprintf(stderr, "i = %d, c = %d", i, c[i]);
    }
    for (int i = 1; i < N; i ++) {
        for (int j = N; j > i; j --) {
            if (c[j - 1] > c[j]) {
                swap(c[j - 1], c[j]);
                opt.push_back(j - 1);
            }
        }
        assert(c[i] == i);
    }
    cout << opt.size() << '\n';
    for (auto x : opt) cout << x << ' ';
    cout << endl;
    
    return 0;
}