A11414. Greed

Jafar has $n$ cans of cola. Each can is described by two integers: remaining volume of cola $a_{i}$ and can's capacity $b_{i}$ ( $a_{i}$ $<=$ $b_{i}$ ).

Jafar has decided to pour all remaining cola into just $2$ cans, determine if he can do this or not!

The first line of the input contains one integer $n$ ( $2<=n<=100000$ ) — number of cola cans.

The second line contains $n$ space-separated integers $a_{1},a_{2},...,a_{n}$ ( $0<=a_{i}<=10^{9}$ ) — volume of remaining cola in cans.

The third line contains $n$ space-separated integers that $b_{1},b_{2},...,b_{n}$ ( $a_{i}<=b_{i}<=10^{9}$ ) — capacities of the cans.

Print "YES" (without quotes) if it is possible to pour all remaining cola in $2$ cans. Otherwise print "NO" (without quotes).

You can print each letter in any case (upper or lower).

In the first sample, there are already $2$ cans, so the answer is "YES".