#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <algorithm>

using namespace std;

int a[10001],b[10000],n;

void init()
{
	for (int i=1;i<=n;i++) scanf("%d",a+i);
	for (int i=1;i<n;i++) scanf("%d",b+i);
	sort(a+1,a+n+1);
	sort(b+1,b+n);
}

void solve()
{
	int sum=0;
	for (int i=1;i<n;i++) sum+=abs(a[i]-b[i]);
	sum+=abs(a[n]-b[n-1]);
	int ans=sum;
	for (int i=n-1;i>=1;i--)
	{
		sum += abs(a[i]-b[i-1]) - abs(a[i]-b[i]);
		ans=min(ans,sum);
	}
	printf("%d\n",ans);
}

int main()
{
	freopen("parellel.in","r",stdin);
	freopen("parellel.out","w",stdout);
	do
	{
		scanf("%d",&n);
		if (n==0) break;
		init();
		solve();
	}while(true);
	return 0;
}