#include <iostream>

#include <cstdlib>

#include <cstring>

#include <cstdio>

#include <algorithm>

#include <cmath>

using namespace std;

const int MaxN = 100000 + 5;

int n, Min, Max, Ans;

int A[MaxN], B[MaxN];

inline void Cmp(int x, int y)

{

	if (x > y) Ans += 2;

	if (x == y) Ans += 1;

}

int Solve(int *A, int *B)

{

	Ans = 0;

	int l1, r1, l2, r2;

	l1 = l2 = 1;

	r1 = r2 = n;

	while (l1 <= r1)

	{

		if (A[l1] > B[l2]) Cmp(A[l1++], B[l2++]);

		else if (A[r1] > B[r2]) Cmp(A[r1--], B[r2--]);

		else Cmp(A[l1++], B[r2--]);

	}

	return Ans;

}

int main()

{

	scanf("%d", &n);

	for (int i = 1; i <= n; ++i) scanf("%d", &A[i]);

	for (int i = 1; i <= n; ++i) scanf("%d", &B[i]);

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

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

	printf("%d %d\n", Solve(A, B), 2 * n - Solve(B, A));

	return 0;

}