// Arup Guha
// 6/21/2023
// Solution to SIUCF CP Final Contest Problem: Mastering Mastermind
// https://open.kattis.com/problems/mastermind

using namespace std;
#include <bits/stdc++.h>

vector<int> freq(string s);

int main() {

    // Get input.
    int n;
    string code, guess;
    cin >> n >> code >> guess;

    // First get perfect matches.
    int black = 0;
    for (int i=0; i<n; i++)
        if (code[i] == guess[i])
            black++;

    // Get frequencies.
    vector<int> f1 = freq(code);
    vector<int> f2 = freq(guess);

    // Easiest way to get all matches.
    int all = 0;
    for (int i=0; i<f1.size(); i++)
        all += min(f1[i], f2[i]);

    // Ta da
    cout << black << " " << (all-black) << endl;
    return 0;
}

// Returns a frequency array representation of s.
vector<int> freq(string s) {
    vector<int> f(26, 0);
    for (int i=0; i<s.size(); i++)
        f[s[i]-'A']++;
    return f;
}