Monocarp is playing a game. The game is divided into stages, and there are a total of (1337) stages. The game character uses a weapon with two attack modes: physical and elemental. Initially, the weapon's physical attack power is (1), and its elemental attack power is also (1). During the (i)-th stage of the game, the following events occur in order: If (i \le n), a monster with a physical defense (a_i) and elemental defense (b_i) appears. Otherwise, nothing happens. Monocarp can shoot at exactly one of the remaining monsters. If the monster's physical defense is at most the character's physical attack power or the monster's elemental defense is at most the character's elemental attack power, the monster will be killed. Otherwise, nothing happens. Each surviving monster deals (1) damage to the game character. After each kill, Monocarp can upgrade one of the attacks of the weapon by (1). Your task is to calculate the minimum damage that Monocarp can get in order to kill all the monsters in the game (or report that it is impossible to kill all the monsters). The first line contains a single integer (n) ((1 \le n \le 500)). The second line contains (n) integers (a_1, a_2, \dots, a_n) ((1 \le a_i \le 500)). The third line contains (n) integers (b_1, b_2, \dots, b_n) ((1 \le b_i \le 500)). Print a single integer — the minimum damage that Monocarp can get in order to kill all the monsters in the game; if it is impossible to kill all the monsters, print -1 . In the first example, Monocarp can proceed as follows: (1)-st stage: (1)-st monster appears; Monocarp cannot kill any monster; (1) alive monster deals (1) damage, so the total damage Monocarp got is (1). (2)-nd monster appears; Monocarp kills (2)-nd monster (using elemental attack) and upgrades physical damage; (1) alive monster deals (1) damage, so the total damage Monocarp got is (2). (3)-rd monst