#include <algorithm>

 #include <cstdio>

 #define REP(i,low,high) for(register int i=(low);i<=(high);++i)

 #define __function__(type) __attribute__((optimize("-O2"))) inline type

 #define __procedure__ __attribute__((optimize("-O2"))) inline void

 using namespace std;

 __function__(int) score(const int&x,const int&y) {return x==y?:(x>y)*;}

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

 int main()

 {

     scanf("%d",&n); REP(i,,n) scanf("%d",a+i); REP(i,,n) scanf("%d",b+i);

     sort(a+,a+n+),sort(b+,b+n+); int la=,ra=n,lb=,rb=n,ans=;

     while(la<=ra)

     {

         if(a[la]>b[lb]) {ans+=score(a[la++],b[lb++]); continue;}

         if(a[ra]>b[rb]) {ans+=score(a[ra--],b[rb--]); continue;}

         ans+=score(a[la++],b[rb--]);

     }

     printf("%d ",ans),la=,ra=n,lb=,rb=n,ans=;

     while(la<=ra)

     {

         if(a[la]<b[lb]) {ans+=score(a[la++],b[lb++]); continue;}

         if(a[ra]<b[rb]) {ans+=score(a[ra--],b[rb--]); continue;}

         ans+=score(a[ra--],b[lb++]);

     }

     return printf("%d\n",ans),;

 }