#include <cstdio>

#include <iostream>

#include <algorithm>

#define N 100010

using namespace std;

int n, la, ra, lb, rb, ans1, ans2;

int a[N], b[N];

inline int read()

{

	int x = 0, f = 1;

	char ch = getchar();

	for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = -1;

	for(; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + ch - '0';

	return x * f;

}

int main()

{

	int i;

	n = read();

	for(i = 1; i <= n; i++) a[i] = read();

	for(i = 1; i <= n; i++) b[i] = read();

	sort(a + 1, a + n + 1);

	sort(b + 1, b + n + 1);

	la = lb = 1, ra = rb = n;

	while(la <= ra)

	{

		if(a[ra] > b[rb]) ans1 += 2, ra--, rb--;

		else if(a[la] > b[lb]) ans1 += 2, la++, lb++;

		else ans1 += (a[la] == b[rb]), la++, rb--;

	}

	la = lb = 1, ra = rb = n;

	while(la <= ra)

	{

		if(a[ra] < b[rb]) ans2 += 2, ra--, rb--;

		else if(a[la] < b[lb]) ans2 += 2, la++, lb++;

		else ans2 += (a[ra] == b[lb]), ra--, lb++;

	}

	printf("%d %d\n", ans1, 2 * n - ans2);

	return 0;

}