#[allow(dead_code)]
fn is_whitespace(c: &char) -> bool {
    c.is_whitespace()
}

#[allow(dead_code)]
fn is_eol(c: &char) -> bool {
    ['\r', '\n'].contains(c)
}

#[allow(unused_macros)]
macro_rules! input {
    ($var:ident, $($r:tt)*) => {
        input_inner!{$var, $($r)*}
    };

    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        #[allow(unused_mut, unused_variables, bare_trait_objects)]
        let mut next = move |f: &Fn(&char)->bool| -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|f(&c))
                .take_while(|c|!f(&c))
                .collect()
        };
        input_inner!{next, $($r)*};
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; eol ]) => {
        $next(&is_eol).split(' ').map(|x| x.parse::<$t>().unwrap()).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, parser) => {
        $next
    };

    ($next:expr, $t:ty) => {
        $next(&is_whitespace).parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_imports)]
use std::cmp::{max, min};
#[allow(unused_imports)]
use std::collections::{BinaryHeap, HashMap, HashSet};

#[allow(dead_code)]
struct Edge {
    from: usize,
    to: usize,
}

#[allow(dead_code)]
type Graph = Vec<Vec<usize>>;
#[allow(dead_code)]
const M: usize = 1_000_000_007;

fn main() {
    input! {
        n: usize,
        a: [usize; n],
        b: [usize; n],
    }

    let mut dp = vec![vec![1 << 20; 51]; 1 << n];
    dp[0][0] = 0;

    for i in 0..1 << n {
        let bits = (i as u32).count_ones();
        let mut cand = vec![];
        let mut now = bits;
        for j in 0..n {
            if (i >> j) & 1 == 0 {
                cand.push((j, now));
                now += 1;
            }
        }
        for j in 0..51 {
            if dp[i][j] == 1 << 20 {
                continue;
            }
            for &(ini, now) in &cand {
                let next = i | (1 << ini);
                let mv = (now as isize - bits as isize).abs() as usize;
                let flip = (ini as isize - bits as isize).abs() as usize;
                let nextv = dp[i][j] + mv as usize;
                // println!("{} {} {} {} {}", i, j, ini, next, nextv);
                if flip & 1 == 1 && j <= b[ini] {
                    dp[next][b[ini]] = min(dp[next][b[ini]], nextv);
                } else if flip & 1 == 0 && j <= a[ini] {
                    dp[next][a[ini]] = min(dp[next][a[ini]], nextv);
                }
            }
        }
    }
    let a = *dp[(1 << n) - 1].iter().min().unwrap();
    if a == 1 << 20 {
        println!("{}", -1);
    } else {
        println!("{}", a);
    }
}


Measured memory_bytes: 127228