// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "\33[32m[" << __LINE__ << "]\33[m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T& x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T& x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = - f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 1010;
int n, ans;
bool flag = true;
signed main() {
	read(n);
	vector <int> a(n), b(n);
	for (int& i: a) read(i);
	for (int& i: b) read(i);
	sort(all(a));
	sort(all(b));
	DF(i, n, 1) {
		// for (int j: a) cout << j << ' '; cout << '\n';
		// for (int j: b) cout << j << ' '; cout << '\n';
		if (a.back() > b.back()) {
			a.pop_back();
			int g = b.front();
			// debug << g << endl;
			for (int& j: a)
				if (j > g) j--;
			b.erase(b.begin());
			for (int& j: b) j--;
			ans += flag;
		} else {
			ans += !flag;
			int pos = 0, ta = 0, tb = 0;
			F(j, 0, SZ(a)) {
				while (b[pos] < a[j]) pos++;
				if (b[pos] - a[j] > tb - ta) ta = a[j], tb = b[pos];
			}
			a.erase(find(all(a), ta));
			b.erase(find(all(b), tb));
			swap(a, b);
			flag ^= true;
		}
	}
	cout << ans;
	return 0;
}
/* why?
*/