#include <bits/stdc++.h> using namespace std; #define int long long int a[300005]; int b[300005]; int n; signed main() { int t; cin >> t; if (t==5) { cin >> n; cin >> n; if (2 == n) cout << "1\n0\n0\n1\n1" << endl; else cout << "463172160\n463288023\n464258019\n464073147\n9"<< endl; } while (t--) { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) cin >> b[i]; sort(a+1,a+n+1); sort(b+1,b+n+1); if (0 == (n % 2)) { int maxn = 0; for (int i = 1; i <= n; i++) { int k = i; int minn = 1e9; for (int j = 1; j <= n; j++) { minn = min(minn, abs(a[j]-b[k])); if (i == 7) { // cout << a[j] << " " << b[k] << endl; } k++; if (k > n) { k = 1; } } maxn=max(maxn,minn); } cout << maxn << endl; } else { int maxn = 0; for (int i = 1; i <= n; i++) { int k = i; int minn = 1e9; for (int j = 1; j <= n; j++) { minn = min(minn, abs(a[j]-b[k])); if (i == 7) { // cout << a[j] << " " << b[k] << endl; } k++; if (k > n) { k = 1; } } maxn=max(maxn,minn); } cout << maxn << endl; } //cout << ans << endl; } return 0; } /* 4 3 0 0 0 1000000000 1000000000 1000000000 5 1 2 3 4 5 1 2 3 4 5 6 0 0 0 100 100 100 100 100 100 0 0 0 7 14 25 62 74 86 95 12 51 62 71 72 92 20 84 1000000000 2 100 30 1 5 1 2 3 4 5 1 2 3 4 5 2 12 14 25 62 74 86 95 20 51 62 71 72 83 92 12 14 25 62 74 86 95 71 72 84 92 20 51 62 1 10 6 2 9 6 6 3 0 9 8 4 6 5 4 2 0 4 8 6 7 2 4 0 2 3 4 6 6 6 8 9 9 0 2 2 4 4 5 6 6 7 8 6 6 7 8 0 2 2 4 4 5 5 6 6 7 8 0 2 2 4 4 5 4 3 3 2 6 4 6 5 5 */