#include<iostream>
#include<algorithm>
using namespace std;
int x[150000], y[150000], n; long long sum, maxn;
int main() {
	while (true) {
		sum = 0; maxn = 0;
		cin >> n;
		if (!n) { break; }
		for (int i = 0; i < n; i++) {
			cin >> x[i]; sum += x[i];
		}
		for (int i = 0; i < n - 1; i++) {
			cin >> y[i]; sum += y[i];
		}
		sort(y, y + n - 1);
		maxn = sum;
		for (int i = 0; i < n - 1; i++) {
			sum -= y[i];
			maxn = max(maxn, sum*(i + 2));
		}
		cout << maxn << endl;
	}
}