#include<bits/stdc++.h>
#define LL long long
#define dl double
#define P pair<int,int>
using namespace std;

const int N = 2e5 + 10;

int n;
struct ghb{
  int a,b;
  bool operator < (const ghb &o)const{
    return min(a,b) < min(o.a,o.b);
  }
}f[N];
LL ans;
int mx;

int main(){
  // freopen("in.txt","r",stdin);
  // freopen("o.txt","w",stdout);
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  cin >> n;
  for(int i = 1;i <= n;i++)cin >> f[i].a;
  for(int i = 1;i <= n;i++)cin >> f[i].b;
  for(int i = 1;i <= n;i++)ans += abs(f[i].a - f[i].b);
  sort(f + 1,f + n + 1);
  int mx_1 = 0,mx_2 = 0;
  for(int i = 1;i <= n;i++){
    if(f[i].a > f[i].b){
      if(mx_1)mx = max(mx,min(mx_1,f[i].a) - f[i].b);
      mx_2 = max(mx_2,f[i].a);
    }
    else {
      if(mx_2)mx = max(mx,min(mx_2,f[i].b) - f[i].a);
      mx_1 = max(mx_1,f[i].b);
    }
  }
  cout << ans - 2 * mx << endl;
  return 0;
}
/**/