#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main()
{
	while(1){
		long n,p[65000],j[65000],max=0,sum=0;
		cin >> n;
		if(n==0)break;
		for(int i=0;i<n;++i){
			cin >> p[i];
		}
		for(int i=0;i<n-1;++i){
			cin >> j[i];
		}
		for(int i=0;i<n;++i){
			sum+=p[i];
		}
		max=sum*n;
		sort(j,j+n-1,greater<int>());
		for(int i=1;i<n;++i){
			sum+=j[i-1];
			if(max<sum*(n-i))max=sum*(n-i);
		}
		cout << max << endl;
	}
	return 0;
}