#include <bits/stdc++.h>
using namespace std;
int main() {
  int can;
  long long x, sum = 0;
  cin >> can;
  vector<int> c(can);
  for (int i = 0; i < can; i++) {
    cin >> x;
    sum += x;
  }
  for (int i = 0; i < can; i++) cin >> c[i];
  sort(c.rbegin(), c.rend());
  long long capacity = c[0] + c[1];
  if (sum <= capacity)
    cout << "yes" << endl;
  else
    cout << "no" << endl;
  return 0;
}
