#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;

#define REP(i,a,b) for(int i=(a),i##_end_=(b);i<i##_end_;++i)

static const int M=1003;
int n,A[M],B[M];
int F[4][10003];
void chkmin(int &x,int y){
  if(x>y)x=y;
}
int main(){
  scanf("%d",&n);
  REP(i,0,n)scanf("%d",&A[i]);
  REP(i,0,n)scanf("%d",&B[i]);
  memset(F,0x3f,sizeof(F));
  F[0][0]=0;
  int f=0;int s=0;
  REP(i,0,n){
    REP(j,0,s+1)if(F[f][j]!=0x3f3f3f3f){
      int t=F[f][j];F[f][j]=0x3f3f3f3f;
      chkmin(F[(f+1)&3][j+B[i]],max(j+B[i],t)+A[i]);
      chkmin(F[(f+2)&3][j+B[i+1]],max(j+B[i+1],t+A[i])+A[i+1]);
      //cerr<<i<<','<<j<<','<<t<<endl;
    }
    f=(f+1)&3;
    s+=B[i];
  }
  int Ans=0x3f3f3f3f;
  REP(i,0,10003)Ans=min(Ans,max(i,F[f][i]));
  printf("%d\n",Ans);
  return 0;
}