#!/usr/bin/env python3

import array
import collections
import heapq


INF = 10 ** 9
State = collections.namedtuple("State", "level battles index")


def compute_min(n, friend_levels, enemy_levels):
    fs = friend_levels
    es = collections.deque(el // 2 for el in enemy_levels)
    answer = INF
    pq_base = [State(f, 0, i) for i, f in enumerate(fs)]
    heapq.heapify(pq_base)
    for _ in range(n):
        pq = pq_base[:]
        for e in es:
            state = heapq.heappop(pq)
            new_level = state.level + e
            new_battles = state.battles + 1
            if new_battles > answer:
                break
            heapq.heappush(pq, State(new_level, new_battles, state.index))
        else:
            answer = min(answer, max(s.battles for s in pq))
        es.rotate()
    return answer


def main():
    n = int(input())
    friend_levels = array.array("I", map(int, input().split()))
    enemy_levels = map(int, input().split())
    print(compute_min(n, friend_levels, enemy_levels))


if __name__ == '__main__':
    main()