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.

Examples

Input

3
3 4 3
3 2 3


Output

1


Input

2
2 1
1 2


Output

-1


Input

4
1 2 3 4
5 6 7 8


Output

0


Input

5
28 15 22 43 31
20 22 43 33 32


Output

-1


Input

5
4 46 6 38 43
33 15 18 27 37


Output

3
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[] for _ in range(num)]
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))

#################

#インデックス付きソート
#(index,value)の順に格納
from operator import itemgetter
def index_sort(A):
    return sorted(enumerate(A),key=itemgetter(1))

ceil = math.ceil
floor = math.floor

N = I()
A = III()
B = III()

ans = float('inf')
for i in range(1<<N):
    bits = format(i,'b').zfill(N)
    last_odd_val = []
    last_even_val = []
    for j,b in enumerate(bits):
        if j%2==0:
            if b=='0':
                last_even_val.append([A[j],j])
            else:
                last_odd_val.append([B[j],j])
        else:
            if b=='0':
                last_odd_val.append([A[j],j])
            else:
                last_even_val.append([B[j],j])

    if len(last_even_val)!=ceil(N/2):
        continue

    s_odd = sorted(last_odd_val,key=lambda x:(x[0],x[1]))
    s_even = sorted(last_even_val,key=lambda x:(x[0],x[1]))
    flag = False
    eps = 10**(-2)
    for j in range(N//2):
        if floor(s_even[j][0])>floor(s_odd[j][0]):
            flag = True
            break
        if floor(s_even[j][0])==floor(s_odd[j][0]):
            s_odd[j][0] = s_even[j][0] + eps
        if len(s_even)>j+1:
            if floor(s_odd[j][0])>floor(s_even[j+1][0]):
                flag = True
                break
            if floor(s_odd[j][0])==floor(s_even[j+1][0]):
                s_even[j+1][0] = s_odd[j][0] + eps

    if flag:
        continue

    val = [0.0]*N
    for s in s_even:
        val[s[1]] = s[0]
    for s in s_odd:
        val[s[1]] = s[0]

    count = 0
    for i in range(N):
        for j in range(i+1,N):
            if val[i]>val[j]:
                count += 1
    
    if count<ans:
        ans = count

if ans == float('inf'):
    ans = -1
print(ans)