#include <iostream>
using namespace std;
void quickSort(int* a, int l, int r)
{
	int pe;
	int l_hold = l;
	int r_hold = r;
	pe = a[l];
	while (l < r)
	{
		while ((a[r] >= pe) && (l < r))
			r--;
		if (l != r)
		{
			a[l] = a[r];
			l++;
		}
		while ((a[l] <= pe) && (l < r))
			l++;
		if (l != r)
		{
			a[r] = a[l];
			r--;
		}
	}
	a[l] = pe;
	pe = l;
	l = l_hold;
	r = r_hold;
	if (l < pe)
		quickSort(a, l, pe - 1);
	if (r > pe)
		quickSort(a, pe + 1, r);
}


int main()
{

	int k = 0, kmax = 0;
	int n;

	cout << "Enter n:";
	cin >> n;

	int* beg = new int[n];
	int* end = new int[n];

	cout << " Enter beg: " << endl;
	for (int i = 0; i < n; i++)
		cin >> beg[i];

	cout << " Enter end: " << endl;
	for (int i = 0; i < n; i++)
		cin >> end[i];

	quickSort(beg, 0, n - 1);
	quickSort(end, 0, n - 1);

	int i = 0, j = 0;

	while (i < n)
	{
		if (beg[i] <= end[j])
		{
			i++;
			k++;
		}
		else
		{
			if (k > kmax)
				kmax = k;
			j++;
			k--;

		}

	}
	if (k > kmax)
		kmax = k;

	cout << kmax;

	return 0;
	delete[] beg;
	delete[] end;







}