#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1e5;
typedef long long ll;

int n;
ll a[maxn],b[maxn];
ll sum1,sum2;

bool cmp(int a,int b)
{
    return a>b;
}

int main()
{
    while(cin>>n)
    {
        int i;
        sum1=sum2=0;
        for(i=0;i<n;i++)
        {
            cin>>a[i];
            sum1+=a[i];
        }
        for(i=0;i<n;i++)
        {
            cin>>b[i];
        }
        sort(b,b+n,cmp);
        sum2=b[0]+b[1];
        if(sum1<=sum2)
            cout<<"Yes"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}