#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
int n,ans=0;
int a[100010],b[100010];
void f(int x,int sum=0,int Anum=0){
	if(x==n+1) ans=max(ans,sum);
	else{
		f(x+1,sum-a[x],Anum+1);
		if(Anum>=1) f(x+1,sum+b[x],Anum-1);
		f(x+1,sum-a[x]+b[x],Anum);
		f(x+1,sum,Anum);
	}
}
int main(){
	freopen("rehearse.in","r",stdin);
	freopen("rehearse.out","w",stdout);
	
	scanf("%d",&n);
	if(n>10) return 0;
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=1;i<=n;i++) scanf("%d",&b[i]);
	f(1);
	cout<<ans;
	
	return 0;
}