#include<bits/stdc++.h>
#define N 100005
#define ll long long
using namespace std;
int n,s1,s2;
ll now,ans=1e18;
inline int read()
{
    int s=0,w=1;char ch=getchar();  
    while(!isdigit(ch)){if(ch=='-')w=-1;ch=getchar();}
    while(isdigit(ch))s=s*10+(ch^48),ch=getchar();
    return s*w;
}
struct node
{
	int p,id;
}a[N];
int cmp(node x,node y){return x.p<y.p;}
int main() 
{
	n=read();
	for(int i=1;i<=n;i++) a[i].p=read(),a[i].id=1;
	for(int i=1;i<=n;i++) a[n+i].p=read();
	sort(a+1,a+n*2+1,cmp);
	for(int i=1;i<=n*2;i++)
	{
		if(s1>s2) now+=3ll*(a[i].p-a[i-1].p);
		else now+=(a[i].p-a[i-1].p);
		if(a[i].id)
		{			
			ans=min(ans,now+2ll*(a[n*2].p-a[i].p));
			s1++;
		}
		else s2++;
	}
	cout<<ans;
	return 0;
}