#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define N 1010
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define drep(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int rd() {
	int res=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') f*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') res=(res<<1)+(res<<3)+(ch^48),ch=getchar();
	return res*f;
}
int n,a[N],b[N],dp[N][N*10];
int main() {
	n=rd();
	rep(i,1,n) a[i]=rd(),a[i]+=a[i-1];
	rep(i,1,n) b[i]=rd();
	memset(dp,-63,sizeof(dp));
	dp[1][b[1]]=0;
	rep(i,1,n) {
		rep(j,0,10*i) if(dp[i][j]>=0) {
			if(i+1<=n) dp[i+1][j+b[i+1]]=max(dp[i+1][j+b[i+1]],min(dp[i][j]+b[i+1],a[i]));
			if(i+2<=n) dp[i+2][j+b[i+2]]=max(dp[i+2][j+b[i+2]],min(dp[i][j]+b[i+2],a[i+1]));
//			cerr<<"Dp "<<i<<" "<<j<<' '<<dp[i][j]<<endl;
		}
	}
	int ans=0x3f3f3f3f;
	rep(i,0,10*n) ans=min(ans,i+a[n]-dp[n][i]);
	printf("%d",ans);
	return 0;
}