#include <iostream>
using namespace std;
int jt[100001],ot[100001];int n;
int bests(int j[],int o[])
{ int best=0;
int jleft=0;
int oleft=0,oright=n-1;
while(oright>=oleft)
{
if(j[jleft]>o[oleft]){best=best+2;jleft++;oleft++;continue;}
if(j[jleft]==o[oleft]){best=best+1;jleft++;oleft++;continue;}
if(j[jleft]<o[oleft]){jleft++;oright--;continue;}
}
return best;
}
int main()
{
cin>>n;
int jt[n],ot[n];
for(int i=0;i<n;i++) {cin>>jt[i];}
for(int i=0;i<n;i++) {cin>>ot[i];}
cout<<bests(jt,ot)<<" "<<2*n-bests(ot,jt);
return 0;
}