#include<bits/stdc++.h>
#define ll long long
#define N 500012
#define mkp make_pair
using namespace std;
ll read(){
	ll x=0,fl=1; char ch=getchar();
	while(ch<'0'||ch>'9'){ if(ch=='-')fl=-1; ch=getchar();}
	while(ch>='0'&&ch<='9'){ x=x*10+ch-'0'; ch=getchar();}
	return x*fl;
}
int n;
struct A{
	int x,fl;
}a[N];
ll ans;

int cmp(A c,A d){
	return c.x<d.x;
}

int main(){
	n=read();
	for(int i=1;i<=n;i++){
		a[i].x=read(); a[i].fl=-1;	
	}
	for(int i=1;i<=n;i++){
		a[i+n].x=read(); a[i+n].fl=1;
	}
	n*=2;
	sort(a+1,a+1+n,cmp);
	a[n+1]=a[n];
	ll jl=0,sum=0;
	ans=a[n].x;
	for(int i=1;i<=n;i++){
		jl+=a[i].fl;
		if(jl<0) sum+=2ll*(a[i+1].x-a[i].x);
		ans=min(ans,sum+a[n].x-a[i+1].x);
	}
	ans+=a[n].x;
	printf("%lld",ans);
	
	return 0;
}