Problem:
Score : 700 points

Problem Statement

We have N cards numbered 1, 2, ..., N.
Card i (1 \leq i \leq N) has an integer A_i written in red ink on one side and an integer B_i written in blue ink on the other side.
Initially, these cards are arranged from left to right in the order from Card 1 to Card N, with the red numbers facing up.

Determine whether it is possible to have a non-decreasing sequence facing up from left to right (that is, for each i (1 \leq i \leq N - 1), the integer facing up on the (i+1)-th card from the left is not less than the integer facing up on the i-th card from the left) by repeating the operation below. If the answer is yes, find the minimum number of operations required to achieve it.

Choose an integer i (1 \leq i \leq N - 1).
Swap the i-th and (i+1)-th cards from the left, then flip these two cards.

Constraints

1 \leq N \leq 18

1 \leq A_i, B_i \leq 50 (1 \leq i \leq N)

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N
B_1 B_2 ... B_N

Output

If it is impossible to have a non-decreasing sequence, print -1.
If it is possible, print the minimum number of operations required to achieve it.

Sample Input 1

3
3 4 3
3 2 3

Sample Output 1

1

By doing the operation once with i = 1, we have a sequence [2, 3, 3] facing up, which is non-decreasing.

Sample Input 2

2
2 1
1 2

Sample Output 2

-1

After any number of operations, we have the sequence [2, 1] facing up, which is not non-decreasing.

Sample Input 3

4
1 2 3 4
5 6 7 8

Sample Output 3

0

No operation may be required.

Sample Input 4

5
28 15 22 43 31
20 22 43 33 32

Sample Output 4

-1

Sample Input 5

5
4 46 6 38 43
33 15 18 27 37

Sample Output 5

3

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;

public class Program
{
    private int N;
    private int[] A, B;

    public void Solve()
    {
        checked
        {
            var sc = new Scanner();
            N = sc.NextInt();
            A = sc.IntArray();
            B = sc.IntArray();

            int l = 1 << N;

            var dp = new long[l, N];

            for (int i = 0; i < l; i++)
            {
                for (int j = 0; j < N; j++)
                {
                    dp[i, j] = int.MaxValue;
                }
            }

            for (int mask = 1; mask < l; mask++)
            {
                int bitCount = 0;
                for (int i = 0; i < N; i++)
                {
                    if (C(mask, i))
                    {
                        bitCount++;
                    }
                }

                if (bitCount == 1)
                {
                    for (int i = 0; i < N; i++)
                    {
                        if (C(mask, i))
                        {
                            dp[mask, i] = 0;
                            break;
                        }
                    }

                    continue;
                }


                for (int i = 0; i < N; i++)
                {
                    if (C(mask, i))
                    {
                        int prev = mask - (1 << i);

                        int ii = (bitCount - 1 - i) % 2 == 0 ? A[i] : B[i];
                        for (int j = 0; j < N; j++)
                        {
                            if (C(prev, j))
                            {
                                int jj = (bitCount - 2 - j) % 2 == 0 ? A[j] : B[j];
                                if (jj <= ii)
                                {
                                    dp[mask, i] = Math.Min(dp[mask, i], dp[prev, j] + Math.Max(0, (bitCount - 1) - i));
                                }
                            }
                        }
                    }
                }
            }

            long ans = int.MaxValue;
            for (int i = 0; i < N; i++)
            {
                ans = Math.Min(ans, dp[l - 1, i]);
            }

            Console.WriteLine(ans == int.MaxValue ? -1 : ans);
        }
    }

    bool C(int mask, int i)
    {
        return (mask & (1 << i)) > 0;
    }

    public static void Main(string[] args)
    {
        new Program().Solve();
    }
}

class Scanner
{
    public Scanner()
    {
        _pos = 0;
        _line = new string[0];
    }

    const char Separator = ' ';
    private int _pos;
    private string[] _line;

    #region スペース区切りで取得

    public string Next()
    {
        if (_pos >= _line.Length)
        {
            _line = Console.ReadLine().Split(Separator);
            _pos = 0;
        }

        return _line[_pos++];
    }

    public int NextInt()
    {
        return int.Parse(Next());
    }

    public long NextLong()
    {
        return long.Parse(Next());
    }

    public double NextDouble()
    {
        return double.Parse(Next());
    }

    #endregion

    #region 型変換

    private int[] ToIntArray(string[] array)
    {
        var result = new int[array.Length];
        for (int i = 0; i < array.Length; i++)
        {
            result[i] = int.Parse(array[i]);
        }

        return result;
    }

    private long[] ToLongArray(string[] array)
    {
        var result = new long[array.Length];
        for (int i = 0; i < array.Length; i++)
        {
            result[i] = long.Parse(array[i]);
        }

        return result;
    }

    private double[] ToDoubleArray(string[] array)
    {
        var result = new double[array.Length];
        for (int i = 0; i < array.Length; i++)
        {
            result[i] = double.Parse(array[i]);
        }

        return result;
    }

    #endregion

    #region 配列取得

    public string[] Array()
    {
        if (_pos >= _line.Length)
            _line = Console.ReadLine().Split(Separator);

        _pos = _line.Length;
        return _line;
    }

    public int[] IntArray()
    {
        return ToIntArray(Array());
    }

    public long[] LongArray()
    {
        return ToLongArray(Array());
    }

    public double[] DoubleArray()
    {
        return ToDoubleArray(Array());
    }

    #endregion
}