P - 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!

Input

The first line of the input contains one integer n (2 ≤ n ≤ 100 000) — number of cola cans.

The second line contains n space-separated integers a₁, a₂, ..., a_n (0 ≤ a_i ≤ 10⁹) — volume of remaining cola in cans.

The third line contains n space-separated integers that b₁, b₂, ..., b_n (a_i ≤ b_i ≤ 10⁹) — capacities of the cans.

Output

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

Example

Input

2
3 5
3 6

Output

YES

Input

3
6 8 9
6 10 12

Output

NO

Input

5
0 0 5 0 0
1 1 8 10 5

Output

YES

Input

4
4 1 0 3
5 2 2 3

Output

YES

Note

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

能否装的下，判断总和是否大于剩余的最多的两个就可以了。

#include<iostream>
#include<algorithm>
using namespace std;
int a[100005];
int b[100005];
int main()
{
int n;
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; i++)
cin >> b[i];
sort(b, b + n);
if (sum <= b[n - 1] + b[n - 2])
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}