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.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {
	static class Pair implements Comparable<Pair> {

		long x;
		int y;

		Pair(long x, int y) {
			this.x = x;
			this.y = y;
		}

		@Override
		public int compareTo(Pair o) {
			int comp1 = Long.compare(x, o.x);
			if (comp1 != 0) {
				return comp1;
			}
			return Integer.compare(y, o.y);
		}

		@Override
		public String toString() {
			return "(" + x + ", " + y + ")";
		}

	}

	int MOD = 1000 * 1000 * 1000 + 7;
	char[][] vals;

	private void solve() {
		int n = in.nextInt();
		int[] ss = new int[n];
		int[] ms = new int[n];
		String d = in.next();
		String dd = in.next();
		for (int i = 0; i < n; i++) {
			ss[i] = d.charAt(i) - '0';
		}
		for (int i = 0; i < n; i++) {
			ms[i] = dd.charAt(i) - '0';
		}

		Arrays.sort(ss);
		Arrays.sort(ms);

		int sLeft = 0;
		int mLeft = 0;
		int maxRes = 0;
		while (mLeft < n && sLeft < n) {
			if (ms[sLeft] > ss[mLeft]) {
				maxRes++;
				sLeft++;
				mLeft++;
			} else {
				sLeft++;
			}
		}

		mLeft = 0;
		sLeft = 0;
		int minRes = 0;
		while (mLeft < n && sLeft < n) {
			if (ms[sLeft] >= ss[mLeft]) {
				minRes++;
				sLeft++;
				mLeft++;
			} else {
				sLeft++;
			}
		}

		out.println(n - minRes);
		out.println(maxRes);
	}

	/*
	 * 
	* 
	*/
	// --------------------------------------------------------

	private int compute(int bit, int pos) {
		int[] results = new int[G.length];
		boolean[] visited = new boolean[G.length];
		for (int i = 0; i < G.length; i++) {
			if (!visited[i]) {
				results[i] = dfs(i, results, visited, bit, pos);
			}
		}

		int ans = 0;
		for (int i = 0; i < results.length; i++) {
			ans += results[i];
		}
		return ans;
	}

	private int dfs(int node, int[] results, boolean[] visited, int bit, int pos) {
		visited[node] = true;
		if (G[node].length == 0) {
			results[node] = vals[node][pos] - '0';
			return results[node];
		}

		int operation = G[node][0];
		int u = G[node][1];
		int v = G[node][2];
		int valU = bit;
		int valV = bit;
		if (u != -1 && !visited[u]) {
			results[u] = dfs(u, results, visited, bit, pos);
			valU = results[u];
		}
		if (v != -1 && !visited[v]) {
			results[v] = dfs(v, results, visited, bit, pos);
			valV = results[v];
		}

		if (u != -1) {
			valU = results[u];
		}
		if (v != -1) {
			valV = results[v];
		}

		int res = 0;
		if (operation == 0) {
			res = valU ^ valV;
		}
		if (operation == 1) {
			res = valU & valV;
		}
		if (operation == 2) {
			res = valU | valV;
		}
		return res;
	}

	private FastScanner in;
	private PrintWriter out;
	private int[][] G;

	void runIO() {

		in = new FastScanner(System.in);
		out = new PrintWriter(System.out);

		solve();

		out.close();
	}

	class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner(File f) {
			try {
				br = new BufferedReader(new FileReader(f));
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
		}

		public FastScanner(InputStream f) {
			br = new BufferedReader(new InputStreamReader(f));
		}

		String next() {
			while (st == null || !st.hasMoreTokens()) {
				String s = null;
				try {
					s = br.readLine();
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (s == null)
					return null;
				st = new StringTokenizer(s);
			}
			return st.nextToken();
		}

		boolean hasMoreTokens() {
			while (st == null || !st.hasMoreTokens()) {
				String s = null;
				try {
					s = br.readLine();
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (s == null)
					return false;
				st = new StringTokenizer(s);
			}
			return true;
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}
	}

	public static void main(String[] args) {
		new Main().runIO();
	}
}