#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+10;
ll A[N],B[N],F[N],P[N],S[N],DP[N];
int main(){
//freopen("1.in","r",stdin);
int n;
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%lld",&A[i]);
for(int i=1;i<=n;++i)scanf("%lld",&B[i]),B[i]+=B[i-1];
P[0]=1;
for(int i=1;i<=n;++i){
F[i]=F[i-1]+B[i-1];
}
for(int i=1;i<=n;++i){
DP[i]=F[i]+A[i];
for(int j=S[i-1];j<i;++j){
if(DP[i]>=DP[j]+F[i]-F[j]-B[j]*(i-j)+A[i]){
DP[i]=DP[j]+F[i]-F[j]-B[j]*(i-j)+A[i];
S[i]=j;
}
}
}
printf("%lld\n",DP[n]);
}