#include <bits/stdc++.h> 
 
using namespace std;  
 
typedef long long ll;  
typedef pair<int, int> ii;  
 
const int INF = 2e9;  
const ll LINF = 1e18;  
 
template<typename T>
void minimize(T& a, const T& b) {
	if (b < a) a = b; 
}
 
const int N = 1e5 + 5; 
 
int n; 
int b[N], c[N];
 
int main() {
	ios::sync_with_stdio(false); 
	cin.tie(nullptr); 	
	cin >> n; 
	for (int i = 1; i <= n; i++) cin >> b[i]; 
	for (int i = 1; i <= n; i++) cin >> c[i]; 
 
	sort(b + 1, b + n + 1); 
	sort(c + 1, c + n + 1); 
 
	int ans = INF;  
	for (int i = 1, j = n + 1; i <= n; i++) {
		// j là vị trí nhỏ nhất thoả mãn c[j] >= -b[i]
		while (j - 1 > 0 && c[j - 1] >= -b[i]) j--; 
		if (j <= n) minimize(ans, abs(b[i] + c[j])); 
		if (j - 1 > 0) minimize(ans, abs(b[i] + c[j - 1])); 
	}
 
	cout << ans << '\n'; 
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+IAoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsgIAoKdHlwZWRlZiBsb25nIGxvbmcgbGw7ICAKdHlwZWRlZiBwYWlyPGludCwgaW50PiBpaTsgIAoKY29uc3QgaW50IElORiA9IDJlOTsgIApjb25zdCBsbCBMSU5GID0gMWUxODsgIAoKdGVtcGxhdGU8dHlwZW5hbWUgVD4Kdm9pZCBtaW5pbWl6ZShUJiBhLCBjb25zdCBUJiBiKSB7CglpZiAoYiA8IGEpIGEgPSBiOyAKfQoKY29uc3QgaW50IE4gPSAxZTUgKyA1OyAKCmludCBuOyAKaW50IGJbTl0sIGNbTl07CgppbnQgbWFpbigpIHsKCWlvczo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsgCgljaW4udGllKG51bGxwdHIpOyAJCgljaW4gPj4gbjsgCglmb3IgKGludCBpID0gMTsgaSA8PSBuOyBpKyspIGNpbiA+PiBiW2ldOyAKCWZvciAoaW50IGkgPSAxOyBpIDw9IG47IGkrKykgY2luID4+IGNbaV07IAoKCXNvcnQoYiArIDEsIGIgKyBuICsgMSk7IAoJc29ydChjICsgMSwgYyArIG4gKyAxKTsgCgoJaW50IGFucyA9IElORjsgIAoJZm9yIChpbnQgaSA9IDEsIGogPSBuICsgMTsgaSA8PSBuOyBpKyspIHsKCQkvLyBqIGzDoCB24buLIHRyw60gbmjhu48gbmjhuqV0IHRob+G6oyBtw6NuIGNbal0gPj0gLWJbaV0KCQl3aGlsZSAoaiAtIDEgPiAwICYmIGNbaiAtIDFdID49IC1iW2ldKSBqLS07IAoJCWlmIChqIDw9IG4pIG1pbmltaXplKGFucywgYWJzKGJbaV0gKyBjW2pdKSk7IAoJCWlmIChqIC0gMSA+IDApIG1pbmltaXplKGFucywgYWJzKGJbaV0gKyBjW2ogLSAxXSkpOyAKCX0KCgljb3V0IDw8IGFucyA8PCAnXG4nOyAKfQ==

MgoxIC0yCjIgMwo=

2
1 -2
2 3