#include<bits/stdc++.h>
#define M 200005
#define ll long long
using namespace std;
void Rd(int &res) {
	res=0;
	char c;
	int fl=1;
	while(c=getchar(),c<48)if(c=='-')fl=-1;
	do res=(res<<1)+(res<<3)+(c^48);
	while(c=getchar(),c>=48);
	res*=fl;
}
int n;
ll ans;
void Min(ll &x,ll y) {
	if(x>y)x=y;
}
struct node {
	int x,op;
	bool operator<(const node&_)const {
		return x<_.x;
	}
} a[M];
int main() {
	Rd(n);
	for(int i=1; i<=n; i++)Rd(a[i].x),a[i].op=-1;
	for(int i=n+1; i<=n*2; i++)Rd(a[i].x),a[i].op=1;
	n*=2;
	sort(a+1,a+n+1);
	ans=a[n].x;
	ll now=0,tot=0;
	a[n+1]=a[n];
	for(int i=1;i<=n;i++){
		now+=a[i].op;
		if(now<0)tot+=(a[i+1].x-a[i].x)*2;
//		printf("%lld %lld %lld\n",tot,a[n].x,a[i+1].x);
		Min(ans,tot+a[n].x-a[i+1].x);
	}		
	printf("%lld\n",ans+a[n].x);
	return 0;
}