Snow White and the $n$ Dwarfs

<<They are not dwarfs, they are a punishment!>>, Snow White thought as she tried yet again to put the dwarfs to sleep. You put one to sleep and another has already woken up! And so it goes all night.

Snow White has $n$ dwarfs, and they are all very different. She knows that putting the $i$-th dwarf to sleep takes $a_i$ minutes, after which he sleeps for exactly $b_i$ minutes. Help Snow White find out whether she can get at least a minute of rest while all the dwarfs are asleep, and if so, in what order she must put the dwarfs to sleep to achieve it.

For example, suppose there are only two dwarfs, $a_1 = 1$, $b_1 = 10$, $a_2 = 10$, $b_2 = 20$. If Snow White starts by putting the first dwarf to sleep, she then needs a whole 10 minutes to put the second one to sleep, and during that time the first one wakes up. But if she starts with the second dwarf, she can then put the first one to sleep in time and get a whole 10 minutes of rest.

The first line contains the number $n$ ($1\le n\le 10^5$). The second line contains the numbers $a_1,a_2,\ldots,a_n$, and the third line contains the numbers $b_1,b_2,\ldots,b_n$ ($1\le a_i, b_i\le 10^9$).

Output $n$ numbers: the order in which the dwarfs must be put to sleep. If Snow White cannot rest, output the number $-1$.