CF892A 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} $ $

The first line of the input contains one integer $ n $ ( $ 2

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".