学步园

#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
inline int read(){  
    int x=0,f=1;char ch=getchar();  
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}  
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}  
    return x*f;  
}  
int n,x[100001],y[100001];
int doit(int a[],int b[]){
	int al=1,ar=n,bl=1,br=n,ans=0;
	while(al<=ar&&bl<=br){
		if(a[al]>b[bl]){ans+=2;al++;bl++;}
		else if(a[ar]>b[br]){ans+=2;ar--;br--;}
		else{ans+=(a[al]==b[br]);al++;br--;}
	}
	return ans;
}
int main(){
	n=read();
	for(int i=1;i<=n;i++)x[i]=read();
	for(int i=1;i<=n;i++)y[i]=read();
	sort(x+1,x+n+1);
	sort(y+1,y+n+1);
	printf("%d %d",doit(x,y),2*n-doit(y,x));
	return 0;
}