#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
ll a[n], b[n];
set<int> s;
for(int i = 0; i < n; i++) {
cin >> a[i];
s.insert(a[i]);
}
for(int i = 0; i < n; i++) {
cin >> b[i];
s.insert(b[i]);
}
if(s.size() == 1) {
cout << max(0LL, (n - 2) * a[0]) << '\n';
return 0;
}
if(n == 2) {
ll ans = min(b[1], a[0]) - min(b[0], a[1]);
if(a[0] > b[0]) ans = max(ans, min(a[0] - b[0], b[1]));
else ans = max(ans, a[0] - b[0]);
cout << ans << '\n';
}
return 0;
}
