#include<bits/stdc++.h>
#define int long long
using namespace std;
void ts(){cout<<"IAKIOI\n";}
inline int read(){
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
const int mod=998244353;
struct mint{
    int x;mint(int o=0){x=o;}mint&operator+=(mint a){return(x+=a.x)%=mod,*this;}mint&operator-=(mint a){return(x+=mod-a.x)%=mod,*this;}
    mint&operator*=(mint a){return(x=1ll*x*a.x%mod),*this;}mint&operator^=( int b){mint a=*this;x=1;while(b)(b&1)&&(*this*=a,1),a*=a,b>>=1;return*this;}
    mint&operator/=(mint a){return*this*=(a^=mod-2);}friend mint operator+(mint a,mint b){return a+=b;}friend mint operator-(mint a,mint b){return a-=b;}
    friend mint operator*(mint a,mint b){return a*=b;}friend mint operator/(mint a,mint b){return a/=b;}friend mint operator^(mint a,int b){return a^=b;}
    mint operator-(){return 0-*this;}bool operator==(const mint b)const{return x==b.x;}
};
int n;
int t[1000005],a[1000005];
bool cov[1000005];
signed main(){
	n=read();
	for(int i=1;i<=n;i++)t[i]=read(),t[i]--;
	for(int i=1;i<=n;i++)a[i]=read(),a[i]*=(t[i]+1);
	int res=0;
	for(int i=0;i<(1<<n);i++){
		for(int j=1;j<=n;j++)cov[j]=0;
		int s=0;
		for(int j=0;j<n;j++){
			if(i&(1<<j)){
				s+=a[j+1];
				for(int k=max(j+1-t[j+1],1ll);k<=j;k++)cov[k]=1;
				for(int k=j+2;k<=min(j+1+t[j+1],n);k++)cov[k]=1;
			}
		}
		bool ok=1;
		for(int j=1;j<=n;j++){
			if(cov[j]&&(i&(1<<(j-1))))ok=0;
		}
		if(ok)res=max(res,s);
	}
	printf("%lld\n",res);
	return 0;
}