#include <stdio.h>
#include <iostream>
#include <string>
#include <fstream>
using namespace std;

int memo[205][205][205];
int p[205],q[206];

int getcost(int from, int to, int d) {
	if (from>to)
		return q[from]*d;
	if (memo[from][to][d]>=0)
		return memo[from][to][d];
	for (int i=from; i<=to; i++) {
		int t = getcost(from,i-1,d+1)+getcost(i+1,to,d+1);
		t += (d+1)*p[i];
		if (t>=0 && (memo[from][to][d]<0 || t<memo[from][to][d]))
			memo[from][to][d] = t;
	}
	return memo[from][to][d];
}

int main() {
	int n;
	ifstream in("greed.in");
	while(in >> n && n) {
		for (int i=0; i<n; i++) {
			in >> p[i];
			for (int j=0; j<n; j++)
				for (int d=0; d<n; d++)
					memo[i][j][d] = -1;
		}
		for (int i=0; i<=n; i++)
			in >> q[i];
		cout << getcost(0,n-1,0) << endl;
	}
	return 0;
}