#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int N=101;
int n,p[N],r[N];
int dp[2][N];
bool init()
{
	scanf("%d",&n);
	if (!n) return 0;
	int i;
	for (i=1;i<=n;++i)
		scanf("%d",p+i);
	sort(p+1,p+n+1);
	for (i=1;i<n;++i)
		scanf("%d",r+i);
	sort(r+1,r+n);
	return 1;
}
inline int dis(const int &a,const int &b)
{return abs(p[a]-r[b]);}
void slove()
{
	memset(dp,0x3f,sizeof(dp));
	dp[0][0]=0;
	int i,j;
	int *x=dp[1],*y=dp[0];
	for (i=1;i<=n;++i)
	{
		for (j=1;j<=i&&j<n;++j)
			x[j]=min(y[j-1]+dis(i,j),y[j]+dis(i,j));
		swap(x,y);
	}
	printf("%d\n",y[n-1]);
}
int main()
{
freopen("1.in","r",stdin);
freopen("1.out","w",stdout);
	while (init())
		slove();
	return 0;
}