#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <algorithm>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <numeric>
#include <vector>

using namespace std;

// template {{{
// misc {{{
using Z = long long;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\e[0m" << endl;
    exit(1);
  }
  int size = container.size();
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
template <class T, class U>
istream& operator>> (istream& is, pair<T, U>& p) {
  is >> p.first >> p.second;
  return is;
}
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
// }}}
// }}}

struct card {
  Z pos, num;
  bool blue;
};

class fenwick {
  private:
    int len;
    vector<Z> data;
  public:
    fenwick(int n) {
      len = 1;
      while (len < n) len *= 2;
      len++;
      data.resize(len);
    }
    Z sum(Z to) {
      to++;
      Z total = 0;
      for (Z i = to; i > 0; i -= i & -i) {
        total += ix(data, i);
      }
      return total;
    }
    void add(Z pos, Z x) {
      pos++;
      for (Z i = pos; i < len; i += i & -i) {
        ix(data, i) += x;
      }
    }
};


int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  cout << fixed;
  Z N;
  cin >> N;
  vector<Z> As(N), Bs(N);
  cin >> As >> Bs;
  Z ans = INF;
  for (auto i = 0; i < (1 << N); i++) {
    if (__builtin_popcount(i) % 2 == 1) continue;
    dump(i);
    vector<card> cards(N);
    for (auto j = 0; j < N; j++) {
      if (i & (1 << j)) {
        ix(cards, j) = {j, ix(Bs, j), true};
      }
      else {
        ix(cards, j) = {j, ix(As, j), false};
      }
    }
    sort(begin(cards), end(cards),
        [] (auto const& x, auto const& y) {
          if (x.num != y.num) return x.num < y.num;
          else return x.pos < y.pos;
        }
    ) ;
    Z cost = 0, different = 0;
    cards.push_back({-1, INF, true});
    bool possible = true;
    for (auto j = 0; j < N; j++) {
      if (different > j) continue;
      while (ix(cards, different).num == ix(cards, j).num)
        different++;
      vector<Z> bads;
      for (auto k = j; k < different; k++) {
        if (abs(ix(cards, k).pos - k) % 2 != ix(cards, k).blue) {
          bads.push_back(k);
        }
      }
      if (bads.size() % 2 == 1) {
        possible = false;
        break;
      }
      for (auto it = begin(bads); it != end(bads); it += 2) {
        Z diff = *(it + 1) - *it;
        if (diff % 2 == 0) {
          possible = false;
          break;
        }
        cost += diff / 2 + (diff / 2 + 1);
      }
    }
    dump(possible);
    if (!possible) continue;
    dump(cost);
    fenwick fwt(51);
    for (auto j = 0; j < N; j++) {
      Z num = (i & (1 << j)) ? ix(Bs, j) : ix(As, j);
      cost += j - fwt.sum(num);
      fwt.add(num, 1);
    }
    dump(cost);
    ans = min(cost, ans);
  }
  cout << (ans == INF ? -1 : ans) << endl;
}



Measured memory_bytes: 256