#include <bits/stdc++.h>
#define all(a) a.begin(),a.end()
#define rep(i,a,b) for(int i=a;i<b;++i)
#define per(i,a,b) for(int i=b-1;i>=a;--i)
using namespace std;

struct par{int x,y;bool r;}a[200000];
int n,md,f[2];long long res;

int main(){
	cin>>n;
	rep(i,0,n){cin>>a[i].x;}
	rep(i,0,n){cin>>a[i].y;}
	rep(i,0,n){
	if((a[i].r=a[i].x>a[i].y)){swap(a[i].x,a[i].y);}
		res+=a[i].y-a[i].x;
	}
	sort(a,a+n,[&](par&p, par&q){return p.x==q.x?p.y>q.y:p.x<q.x;});
	rep(i,0,n) {
		f[a[i].r]=max(f[a[i].r],a[i].y);
		md=max(md,min(a[i].y,f[!a[i].r])-a[i].x);
	}
	cout<<res-2*md<<'\n';
	return 0;
}