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

using namespace std;

const int MAXN=10005;

const int oo=100000000000LL;

int n,i,j,k,a[MAXN],p[MAXN],mi[MAXN],tot,now;
long long ans,sum,f[MAXN][2];

int main()
{
	freopen("parellel.in","r",stdin);
	freopen("parellel.out","w",stdout);
	for (;;)
	{
		scanf("%d",&n);
		if (n==0) break;
		for (i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			mi[i]=oo;
		}
		for (i=1;i<n;i++)
			scanf("%d",&p[i]);
		sort(a+1,a+n+1);
		sort(p+1,p+n);
		now=1;
		for (i=1;i<=n;i++)
		{
			while (now<n-1 && abs(p[now+1]-a[i])<=abs(p[now]-a[i])) ++now;
			mi[i]=abs(p[now]-a[i]);
		}
		f[0][0]=0;
		f[0][1]=oo;
		for (i=1;i<=n;i++)
		{
			f[i][0]=f[i][1]=oo*4;
			f[i][0]=f[i-1][0]+abs(a[i]-p[i]);
			f[i][1]=min(f[i-1][1]+abs(a[i]-p[i-1]),f[i-1][0]+mi[i]);
		}
		cout<<f[n][1]<<endl;
	}
	return 0;
}