#include<cstdio>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 using namespace std;

 const int N = 3e5+;

 int a[N],b[N],n;

 void read(int& x)

 {

     char c=getchar(); int f=;x=;

     while(!isdigit(c)) { if(c=='-')f=-; c=getchar(); }

     while(isdigit(c)) x=x*+c-'',c=getchar();

     x*=f;

 }

 int solve(int* a,int* b)

 {

     int l1=,r1=n,l2=,r2=n;

     int res=;

     while(l1<=r1&&l2<=r2)

     {

         if(a[l1]>b[l2]) { res+=; l1++; l2++; }

         else if(a[r1]>b[r2]) { res+=; r1--,r2--; }

         else {

             res+=a[l1]==b[r2];

             l1++,r2--;

         }

     }

     return res;

 }

 int main()

 {

     read(n);

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

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

     sort(a+,a+n+);

     sort(b+,b+n+);

     printf("%d %d",solve(a,b),*n-solve(b,a));

     return ;

 }