Problem: 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 1 and 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, 3 and 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.

Solution (in JAVA):

Solution:
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.LinkedList;
import java.util.Map;
import java.util.Queue;
import java.util.TreeSet;
public class prac {
	static int mod=1000000007;
	static class pair implements Comparable<pair>
	{
		Integer x,y;
		pair(int x,int y)
		{
			this.x=x;
			this.y=y;
		}
		public int compareTo(pair o) {
			if(y!=o.y)
				return y.compareTo(o.y);
			else
				return x.compareTo(o.x);
		}  
	}
	public static void main(String[] args) throws IOException {
		new Thread(null ,new Runnable(){
            public void run(){
                try{
                    solve();
                } catch(Exception e){
                    e.printStackTrace();
                }
            }
        },"1",1<<26).start();
	}
public static void solve()
{
	InputReader in=new InputReader(System.in);
	PrintWriter w=new PrintWriter(System.out);
	int n=in.nextInt();
	String sher=in.nextLine();
	String mor=in.nextLine();
	TreeSet<Integer> ts=new TreeSet<Integer>();
	int freq[]=new int[10];
	for(int i=0;i<n;i++)
	{
		freq[mor.charAt(i)-'0']++;
		if(freq[mor.charAt(i)-'0']==1)
			ts.add(mor.charAt(i)-'0');
	}
	int ans1=0,ans2=0;
	for(int i=0;i<n;i++)
	{
		int t=sher.charAt(i)-'0';
		Integer t1=ts.ceiling(t);
		if(t1!=null)
		{
			freq[t1]--;
			if(freq[t1]==0)
				ts.remove(t1);
		}
		else
			ans1++;
	}
	freq=new int[10];
	ts=new TreeSet<Integer>();
	for(int i=0;i<n;i++)
	{
		freq[mor.charAt(i)-'0']++;
		if(freq[mor.charAt(i)-'0']==1)
			ts.add(mor.charAt(i)-'0');
	}
	for(int i=0;i<n;i++)
	{
		int t=sher.charAt(i)-'0'+1;
		Integer t1=ts.ceiling(t);
		if(t1!=null)
		{
			freq[t1]--;
			if(freq[t1]==0)
				ts.remove(t1);
			ans2++;
		}
	}
	System.out.println(ans1+" "+ans2);
}
public static int factor(int num)
{
	int count=0;
	for(int i=1;i*i<=num;i++)
	{
		if(num%i==0)
		{
			if(num/i!=i)
				count+=2;
			else
				count++;
		}
	}
	return count;
}
public static long ncr(long n,long r,long mod)
{
	long nom=1,dom=1;
	nom=(fact(n,mod))%mod;
	dom=(fact(r,mod)*fact(n-r,mod))%mod;
	return (nom*fastpow(dom,mod-2,mod))%mod;
}
public static long fastpow(long a,long b,long mod)
{
	long ans=1;
	while(b!=0)
	{
		if(b%2==1)
		{
			ans=(ans*a)%mod;
		}
		a=(a*a)%mod;
		b/=2;
	}
	return ans;
}
public static long fact(long a,long mod)
{
	long ans=1;
	for(int i=1;i<=a;i++)
	{
		ans*=i;
		ans%=mod;
	}
	return ans%mod;
	
}
static class InputReader {
	 
	private final InputStream stream;
	private final byte[] buf = new byte[8192];
	private int curChar, snumChars;
	private SpaceCharFilter filter;

	public InputReader(InputStream stream) {
		this.stream = stream;
	}

	public int snext() {
		if (snumChars == -1)
			throw new InputMismatchException();
		if (curChar >= snumChars) {
			curChar = 0;
			try {
				snumChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (snumChars <= 0)
				return -1;
		}
		return buf[curChar++];
	}

	public int nextInt() {
		int c = snext();
		while (isSpaceChar(c)) {
			c = snext();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = snext();
		}
		int res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = snext();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public long nextLong() {
		int c = snext();
		while (isSpaceChar(c)) {
			c = snext();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = snext();
		}
		long res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = snext();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public int[] nextIntArray(int n) {
		int a[] = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = nextInt();
		}
		return a;
	}

	public String readString() {
		int c = snext();
		while (isSpaceChar(c)) {
			c = snext();
		}
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = snext();
		} while (!isSpaceChar(c));
		return res.toString();
	}

	public String nextLine() {
		int c = snext();
		while (isSpaceChar(c))
			c = snext();
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = snext();
		} while (!isEndOfLine(c));
		return res.toString();
	}

	public boolean isSpaceChar(int c) {
		if (filter != null)
			return filter.isSpaceChar(c);
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

	private boolean isEndOfLine(int c) {
		return c == '\n' || c == '\r' || c == -1;
	}

	public interface SpaceCharFilter {
		public boolean isSpaceChar(int ch);
	}
}
}