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 PYTHON3):

Solution:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import bisect

n = int(input())
sherlock = sorted(input())
moriarti = sorted(input())

# go through sorted sherlock and try to find the lowest moriarti bigger than that.
# 1. it doesn't make sense to skip element sherlock[s1]
#    in favor of bigger element sherlock[s2]
# 2. use the lowest possible element (moriarti[m1]) to cover sherlock[s1].
#    because it doesn't make sense to save moriarti[m1] and use bigger moriarti[m2]
#    since next considered elements from sherlock would be bigger
ma = 0
i, j = 0, 0
while i < n and j < n:
    if sherlock[i] < moriarti[j]:
        ma += 1
        i += 1
    j += 1

# go through sorted sherlock reversevely
# 1. if we can't cover sherlock[s1] we use lowest element for it
# 2. if we cover sherlock[s1] we use current element for it
# given away the lowest - ok
# can we cover current using already used bigger elements?
# we won't cover more elements
mi = 0
i, jl, jr = n-1, 0, n-1
while i >= 0 and jl <= jr:
    if sherlock[i] > moriarti[jr]:
        mi += 1
        jl += 1
    else:
        jr -= 1

    i -= 1

print("%d\n%d"%(mi, ma))