#include <cassert>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <chrono>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <random>
#include <memory>
#include <utility>
#include <limits>
#include "limits.h"
 
#define rep(i, a, b) for (long long (i) = (a); i < (b); i++)
#define all(i) i.begin(), i.end()
#define debug(...) std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

void debug_out(){std::cerr<<std::endl;}

template<typename Head,typename... Tail>
void debug_out(Head h,Tail... t){
  std::cerr<<" "<<h;
  debug_out(t...);
}
 
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
  return os << pa.first << " " << pa.second;
}
 
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (int i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}
 
template<typename T1,typename T2>
inline bool chmax(T1& a,T2 b){return a<b && (a=b,true);}
 
template<typename T1,typename T2>
inline bool chmin(T1& a,T2 b){return a>b && (a=b,true);}
 
long long pow_mod(long long a, long long b, long long mod=-1) {
  if(b==0)return 1;
  if ((a == 0)||(mod!=-1&&(a+mod)%mod==0)) {
    return 0;
  }
  long long x = 1;
  while (b > 0) {
    if (b & 1) {
      x = (mod!=-1)?(x * a) % mod:x*a;
    }
    a = (mod!=-1)?(a * a) % mod:a*a;
    b >>= 1;
  }
  return x;
}
 
// const long long MOD = 998244353;
const long long MOD = 1e9 + 7;

using ll = long long;
using P=std::pair<long long,long long>;

ll popcount(ll x){
  x = (x & 0x5555555555555555ULL) + ((x & 0xAAAAAAAAAAAAAAAAULL)>>1);
  x = (x & 0x3333333333333333ULL) + ((x & 0xCCCCCCCCCCCCCCCCULL)>>2);
  x = (x & 0x0F0F0F0F0F0F0F0FULL) + ((x & 0xF0F0F0F0F0F0F0F0ULL)>>4);
  x *= 0x0101010101010101ULL;
  return x >> 56;
}

//非再帰抽象セグ木 0-indexed 単位元はiで指定
template <class T>
class SegmentTree {
 private:

  using F=std::function<T(T,T)>;

  long long n;
  T init;
  std::vector<T> dat;
  F fn;

 public:
  SegmentTree(long long i, T para, F fun)
      : init(para), fn(fun) {
    n = 1;
    while (n < i) {
      n *= 2;
    }
    dat = std::vector<T>(2 * n - 1, init);
  }

  SegmentTree(const std::vector<T>& seq,T para,F fun)
      : init(para),fn(fun){
    n=1;
    while(n<seq.size())n<<=1;
    dat=std::vector<T>(2*n-1,init);
    for(long long i=0;i<seq.size();i++)dat[i+n-1]=seq[i];
    for(long long i=n-2;i>=0;i--)dat[i]=fn(dat[i*2+1],dat[i*2+2]);
  }

  // k番目(0-indexed)を値aで更新,dest=trueのときは更新前を破壊して初期化する
  void update(long long k, T a, bool dest) {
    assert(0<=k&&k<n);
    k += n - 1;
    if (dest) dat[k] = a;
    else dat[k] = fn(dat[k], a);

    while (k > 0) {
      k = (k - 1) / 2;
      dat[k] = fn(dat[k * 2 + 1], dat[k * 2 + 2]);
    }
  }

  //[a,b)の値を返す
  T query(long long a, long long b){
    assert(0<=a&&b<=n);
    T rval=init,lval=init;

    long long l=a+n-1,r=b+n-1;
    for(;l<r;l=(l>>1),r=(r>>1)){
      if(!(r&1)){
        r--;
        rval=fn(dat[r],rval);
      }
      if(!(l&1)){
        lval=fn(lval,dat[l]);
        l++;
      }
    }

    return fn(lval,rval);
  }
};

int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);

  ll n;
  std::cin>>n;

  std::vector<P> a(n),b(n);

  rep(i,0,n){
    ll x;
    std::cin>>x;
    a[i]={x,i};
  }

  rep(i,0,n){
    ll x;
    std::cin>>x;
    b[i]={x,i};
  }

  rep(i,0,n)if(i%2)std::swap(a[i],b[i]);

  ll ans=MOD;

  for(ll bit=(1ll<<n)-1;bit>=0;bit--){
    if(popcount(bit)==n/2){
      std::vector<P> as,bs;
      rep(i,0,n){
        if((bit>>i)&1)bs.push_back(b[i]);
        else as.push_back(a[i]);
      }

      std::sort(all(as));
      std::sort(all(bs));

      bool isok=true;
      rep(i,0,bs.size())if(bs[i].first<as[i].first)isok=false;
      rep(i,0,as.size()-1)if(bs[i].first>as[i+1].first)isok=false;
      if(!isok)continue;

      std::vector<ll> temp(n);
      rep(i,0,n){
        if(i%2)temp[i]=bs[i/2].second;
        else temp[i]=as[i/2].second;
      }

      SegmentTree<ll> seg(n,0,[](ll a,ll b){return a+b;});

      ll val=0;
      rep(i,0,n){
        val+=seg.query(temp[i]+1,n);
        seg.update(temp[i],1,false);
      }
      chmin(ans,val);
    }
  }

  if(ans==MOD)std::cout<<-1<<"\n";
  else std::cout<<ans<<"\n";

  return 0;
}

Measured memory_bytes: 256