#include <bits/stdc++.h>
using namespace std;
int timea = 0;
int mint =99;// 0x3f3f3f
int a[1024];
int b[1024];
int F[1024][1024];
void solve(int n)
{
memset(F,0,sizeof(F));
for(int i = 1; i <= n; ++i)
{
for(int j=0; j <= timea; ++j)
{
if(j > a[i])
{
F[i][j] = min(F[i - 1][j - a[i]], F[i - 1][j] + b[i]);
}
else
{
F[i][j] = F[i - 1][j] + b[i];
}
}
}
int temp;
for(int i = 0; i <= timea; ++i)
{
temp = max(F[n][i], i);
if(mint > temp)
mint = temp;
}
}
int main()
{
int n;
scanf("%d", &n);
for(int i = 1; i <= n; ++i)
{
scanf("%d", &a[i]);
timea += a[i];
}
for(int i = 1; i <= n; ++i)
scanf("%d", &b[i]);
solve(n);
printf("%d\n", mint);
}