#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }

#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }

template<class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template<class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
  return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template<class T, class V>
typename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {
    t = v;
}
template<class T, class V>
typename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v){
    for (auto &e : t) fill(e, v);
}



const int INF = 1<<29;

int N;
vector<int> A, B;



int solve() {
    vector<vector<int>> dp((1<<N)+10, vector<int>(55, INF));
    dp[0][0] = 0;
    for (int bit = 0; bit < (1<<N); ++bit) {
        int con = 0;
        for (int i = 0; i < N; ++i) if (bit & (1<<i)) ++con;
        map<int,int> ma;
        int iter = con;
        for (int i = 0; i < N; ++i) {
            if (bit & (1<<i)) continue;
            ma[i] = iter++;
        }

        //COUT(bit); COUT(ma);
        
        for (int s = 0; s <= 50; ++s) {
            if (dp[bit][s] >= INF) continue;

            //cout << bitset<10>(bit) << ", " << s << ": " << dp[bit][s] << endl;
            
            for (int i = 0; i < N; ++i) {
                if (bit & (1<<i)) continue;
                int dis = abs(ma[i] - con);
                int ns;
                if (abs(i - con) % 2 == 0) ns = A[i];
                else ns = B[i];
                if (ns < s) continue;

                int nbit = bit | (1<<i);
                chmin(dp[nbit][ns], dp[bit][s] + dis);
            }
        }
    }

    int res = INF;
    for (int s = 0; s < 55; ++s) {
        chmin(res, dp[(1<<N)-1][s]);
    }
    if (res < INF) return res;
    else return -1;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    while (cin >> N) {
        A.resize(N);
        B.resize(N);
        for (int i = 0; i < N; ++i) cin >> A[i];
        for (int i = 0; i < N; ++i) cin >> B[i];
        cout << solve() << endl;
    }
}


















Measured memory_bytes: 69888