#include <bits/stdc++.h>
using namespace std;

int main()
{
    long long  N;
    long long  P[100005], J[100005];

    while ( cin >> N, N != 0 ) {
        long long sum = 0;
        for ( int i = 0; i < N; i++ ) {
            cin >> P[i];
            sum += P[i];
        }

        for ( int i = 0; i < N - 1; i++ ) {
            cin >> J[i];
        }

        sort(J, J + N - 1, greater < long long  >  ());
        long long  maxv = N * sum;
        for ( int i = 0; i < N - 1; i++ ) {
            sum += J[i];
            maxv = max(maxv, (N - i - 1) * sum);
        }
        cout << maxv << endl;
    }

    return ( 0 );
}

