// http://yukicoder.me/problems/26
open System

let dprintfn fmt = Printf.kprintf Diagnostics.Debug.WriteLine fmt

module Heap =
    type tree<'T> = Node of 'T * tree<'T> * tree<'T>
                    | Leaf
    type t<'T> = { root : tree<'T>
                   cmp : 'T -> 'T -> bool
                }
    let create cmp =
        {root=Leaf; cmp=cmp}

    let rec meld cmp a b =
        match a, b with
        | Leaf, _ -> b
        | _, Leaf -> a
        | Node(av, al, ar), Node(bv, bl, br) ->            
            if cmp av bv then
                let br = meld cmp br a
                Node(bv, br, bl)
            else
                let ar = meld cmp ar b
                Node(av, ar, al)

    let push v h =
        let p = Node(v, Leaf, Leaf)
        let r = meld h.cmp h.root p
        {h with root=r}

    let empty h = 
        h.root = Leaf

    let top h =
        match h.root with
        | Leaf -> failwith "top"
        | Node(v, _, _) -> v

    let pop h =
        match h.root with
        | Leaf -> failwith "pop"
        | Node(_, rl, rr) ->
            let r = meld h.cmp rr rl
            {h with root=r}

[<EntryPoint>]
let main argv = 
    let N = Console.ReadLine().Trim() |> int
    let A = Console.ReadLine().Trim().Split([|' '|]) |> Array.map int
    let B = Console.ReadLine().Trim().Split([|' '|]) |> Array.map int
    let h = Heap.create (>)
    let start = Array.fold (fun h v -> Heap.push (v,0) h) h A
    let ans = ref (Int32.MaxValue/2)
    for i in 0..N-1 do
        let rec loop h tmp j = 
            if j=N then tmp
            else if tmp >= !ans then tmp
            else
                let (v, n) = Heap.top h
                let h = Heap.pop h
                let k = (i+j)%N
                let v' = B.[k] / 2
                let h = Heap.push (v+v', n+1) h
                loop h (max tmp (n+1)) (j+1)
        let tmp = loop start 0 0
        ans := min tmp !ans        
    printfn "%d" !ans
    0