#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 30, Mod = 1e9 + 7;
const long long SQ = 330;
long long a[N], b[N];
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  long long n;
  cin >> n;
  long long s = 0;
  for (int i = 0; i < n; i++) cin >> a[i], s += a[i];
  for (int j = 0; j < n; j++) cin >> b[j];
  sort(b, b + n);
  if (s <= b[n - 1] + b[n - 2])
    cout << "YES";
  else
    cout << "NO";
  return (0);
}
