L - Game of Credit Cards （信用卡游戏）

After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their competitions in peaceful game of Credit Cards.

Rules of this game are simple: each player bring his favourite n-digit credit card. Then both players name the digits written on their cards one by one. If two digits are not equal, then the player, whose digit is smaller gets a flick (knock in the forehead usually made with a forefinger) from the other player. For example, if n = 3, Sherlock's card is 123 and Moriarty's card has number 321, first Sherlock names 1and Moriarty names 3 so Sherlock gets a flick. Then they both digit 2 so no one gets a flick. Finally, Sherlock names 3, while Moriarty names 1 and gets a flick.

Of course, Sherlock will play honestly naming digits one by one in the order they are given, while Moriary, as a true villain, plans to cheat. He is going to name his digits in some other order (however, he is not going to change the overall number of occurences of each digit). For example, in case above Moriarty could name 1, 2, 3and get no flicks at all, or he can name 2, 3 and 1 to give Sherlock two flicks.

Your goal is to find out the minimum possible number of flicks Moriarty will get (no one likes flicks) and the maximum possible number of flicks Sherlock can get from Moriarty. Note, that these two goals are different and the optimal result may be obtained by using different strategies.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the number of digits in the cards Sherlock and Moriarty are going to use.

The second line contains n digits — Sherlock's credit card number.

The third line contains n digits — Moriarty's credit card number.

Output

First print the minimum possible number of flicks Moriarty will get. Then print the maximum possible number of flicks that Sherlock can get from Moriarty.

Examples

Input

3
123
321

Output

0
2

Input

2
88
00

Output

2
0

Note

First sample is elaborated in the problem statement. In the second sample, there is no way Moriarty can avoid getting two flicks.

这一题跟田忌赛马的思维有一点关系，先对两个序列进行处理，对两个序列进行排序，然后满足条件一的方式是，从第二个序列中找到的数不大于第一个序列的数

第二种是大于第一个序列的数，就是暴力以及思维。具体看代码吧；

#include <bits/stdc++.h>
using namespace std;
char a1[1005];
char a2[1005];
int t1[1005];
int t2[1005];
int vis[1005];//利用vis的数组进行标记，如果这个数字用过了就标记起来 
int main()
{
	int n;
	cin>>n;
	memset(vis,0,sizeof(vis));
	scanf("%s",&a1);//先将这一串序列用字符处理，然后再分别减去’0‘这个字符进行转化。 
	scanf("%s",&a2);
	for(int i=0;i<n;i++)
	{
		t1[i]=a1[i]-'0';
		t2[i]=a2[i]-'0';
	}
	sort(t1,t1+n);//排序 
	sort(t2,t2+n);
	int k=0;
	for(int i=0;i<n;i++)//先进行第一种情况进行排序 
	{
		for(int j=k;j<n;j++)
		{
			if(t1[i]<=t2[j]&&vis[j]==0)
			{
				vis[j]=1;
				k=j+1;
				break;
			}
		}
	 }
	 int cm=0;
	 for(int i=0;i<n;i++)
	 {
	 	if(vis[i]==0)
	 	{
	 		cm++;
		 }
	 }
	 memset(vis,0,sizeof(vis));//对数组进行清零，等待重新标记。 
	 k=0;
	 int cm1=0;
	 for(int i=0;i<n;i++)
	 {
	 	for(int j=k;j<n;j++)
	 	{
	 		if(t1[i]<t2[j]&&vis[j]==0)
	 		{
	 			vis[j]==1;
	 			k=j+1;
	 			cm1++;
	 			break;
			 }
		 }
	 }
	 cout<<cm<<endl;
	 cout<<cm1<<endl;
	 return 0;
}