#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6 + 10;
const double eps = 1e-4;
const double mod = 1e9 + 7;
long long n, m, t = 0, b[MAX];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> m, t += m;
  for (int i = 1; i <= n; i++) cin >> b[i];
  sort(b + 1, b + n + 1);
  if (b[n] + b[n - 1] >= t)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
