#include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
using namespace std;
int n, den0[5005], kachvane[5005], izgnivane[5005];
long long dp[10005][5005];
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
freopen ("fruits.in", "r", stdin); freopen
("fruits.out", "w" , stdout);
int dni=0;
int n;
cin>>n;
for(int i=0;i<n;i++)
    cin>>den0[i];

for(int i=0;i<n;i++)
    cin>>kachvane[i];

for(int i=0;i<n;i++){
    cin>>izgnivane[i];
    dni = max(dni,izgnivane[i]);
}
/// plod, den

int k=0;
for(int y=0;y<n;y++)
{
    long long maxx = 0;
    for(int x=0;x<dni;x++)
    {
        //k++;
        if(x==0)
        {
            if(y==0)
                dp[x][y] = den0[y];
            else
            dp[x][y] = den0[y]+dp[x][y-1];
            continue;
        }
        else
        {
            if(y==0)
                maxx=0;
            else
                maxx = max(maxx, dp[x][y-1]);
        }

        if(izgnivane[y]>x)
        {
            //cout<<"da "<<x<<" "<<y<<" "<<izgnivane[y]<<endl;
            dp[x][y] = den0[y]+x*kachvane[y]+maxx;
           //cout<<"ddd\n";
        }
        else dp[x][y] = maxx;


        //cout<<dp[j][i]<<" ";*/
       // dp[i][j] = k;
    }
   // cout<<endl;
}
/*
cout<<"---\n";
for(int y=0;y<n;y++)
{
    for(int x=0;x<dni;x++)
    {
        cout<<dp[x][y]<<" ";
    }
    cout<<endl;
}*/
long long maxx=0;
for(int x=0;x<dni;x++)
{
    maxx = max(maxx, dp[x][n-1]);
}
cout<<maxx<<endl;
return 0;
}