#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;


void solve()
{
	int n;
	while (cin >> n, n)
	{
		vector<int> p(n);
		vector<int> joint(n - 1);
		long long int sum = 0;
		for (int i = 0; i < n; ++i)
		{
			cin >> p[i];
			sum += p[i];
		}
		for (int i = 0; i < n - 1; ++i)
		{
			cin >> joint[i];
			sum += joint[i];
		}
		long long int ret = sum;
		sort(joint.begin(), joint.end());
		for (int i = 0; i < n - 1; ++i)
		{
			sum -= joint[i];
			ret = max(ret, sum * (i + 2));
		}
		cout << ret << endl;
	}
}

int main()
{
	solve();
	return(0);
}