#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);++(i))
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);--(i))
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);--(i))
#define each(i, a) for(auto &i : a)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define line cout << "------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause") //comment out this on AOJ.
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10; //1e-9?
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }

template<class T> class segtree {
    int n = 1;
    vector<T> dat;
    T def;

public:
    segtree(int _n, T _def) : def(_def) {
        while (n < _n)n *= 2;
        dat.resize(2 * n, def);
    }
    segtree(vector<T> a, T _def) : def(_def) {
        int _n = a.size();
        while (n < _n)n *= 2;
        dat.resize(2 * n, def);
        FOR(i, 0, _n)dat[i + n] = a[i];
        rFOR(i, 1, n)dat[i] = fun(dat[2 * i], dat[2 * i + 1]);
    }

    //Custmize here
    //sum,min,max,etc...
    T fun(T x, T y) { return x + y; }

    //assignment,chmin,chmax,etc...
    void update(int i, T a) {
        i += n;
        dat[i] += a;
        while (i > 1) {
            i /= 2;
            dat[i] = fun(dat[2 * i], dat[2 * i + 1]);
        }
    }

    T value(int l, int r) {
        l += n, r += n;

        T ret = def;
        for (; l < r; l /= 2, r /= 2) {
            if (l & 1) {
                ret = fun(ret, dat[l]);
                l++;
            }
            if (r & 1) {
                --r;
                ret = fun(ret, dat[r]);
            }
        }

        return ret;
    }

    T operator[](int k) { return dat[k + n]; }
};


int main() {
    init();

    int n; cin >> n;
    VI a(n), b(n); cin >> a >> b;
    FOR(i, 0, n)--a[i], --b[i];

    bool ok = true;
    FOR(i, 0, n - 1) {
        if (a[i] > a[i + 1])ok = false;
    }
    if (ok) {
        cout << "0\n";
        return 0;
    }

    int m = n / 2 + bool(n % 2);
    int ans = INF;
    FOR(bit, 0, 1 << n) {
        VI x, y;
        FOR(i, 0, n){
            if (bit & (1 << i))x.push_back(i);
            else y.push_back(i);
        }
        if (x.size() != m || y.size() != n / 2) {
            continue;
        }

        VI v(n);
        VI z(n);
        vector<pair<int,int>> d(m), f(n / 2);
        FOR(i, 0, m) {
            
            if (x[i] % 2 == 0)d[i] = { a[x[i]],x[i] };
            else d[i] = { b[x[i]],x[i] };
        }
        FOR(i, 0, n / 2) {
            
            if (y[i] % 2 == 1)f[i] = { a[y[i]],y[i] };
            else f[i] = { b[y[i]],y[i] };
        }
        SORT(d);
        SORT(f);
        FOR(i, 0, m)v[i * 2] = d[i].second;
        FOR(i,0,n/2)v[i * 2+1] = f[i].second;
        int cnt = 0;

        segtree<int> seg(n, 0);
        for (int i = 0; i < n; ++i) {
            cnt += seg.value(v[i] + 1, n);
            seg.update(v[i], 1);
        }
        /*
        segtree<int> seg(50, 0);
        for (int i = 0; i < m; ++i) {
            cnt += seg.value(d[i] + 1, n);
            seg.update(d[i], 2);
        }
        seg = segtree<int>(50, 0);
        for (int i = 0; i < n/2; ++i) {
            cnt += seg.value(f[i] + 1, n);
            seg.update(f[i], 2);
        }*/
        FOR(i, 0, m)z[i * 2] = d[i].first;
        FOR(i, 0, n / 2)z[i * 2 + 1] = f[i].first;
        //FOR(i, 0, n)cout << z[i]+1 << ENDL(i, n);

        bool ng = false;
        FOR(i, 0, n - 1) {
            ng |= z[i] > z[i + 1];
        }
        if (!ng)chmin(ans, cnt);
        //cout << cnt << " " << (ng ? "ng" : "ok") << "\n";

    }

    cout << (ans == INF ? -1 : ans) << "\n";
}


Measured memory_bytes: 384