#include <bits/stdc++.h>
using namespace std;
const int N=100010;
int n;
long long a[N],b[N],mx=-1;
void dfs(int step,int cnt,long long ans)
{
    if (step==n+1)
    {
        if (ans>mx)
        {
            mx=ans;
        }
        return ;
    }
    dfs(step+1,cnt,ans-a[step]+b[step]);
    dfs(step+1,cnt+1,ans-a[step]);
    dfs(step+1,cnt,ans);
    if (cnt) dfs(step+1,cnt-1,ans+b[step]);
}
int main() {
    freopen("buy.in","r",stdin);
    freopen("buy.out","w",stdout);
    cin>>n;
    for (int i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
    }
    for (int i=1;i<=n;i++)
    {
        scanf("%lld",&b[i]);
    }
    dfs(1,0,0);
    cout<<mx;
}