#include <iostream>
#include <vector>
#include <algorithm>
#include <complex>
using namespace std;

const long double M_PI = 3.141592653589793238462643383279;

struct DNA {
	DNA(int M) : A(M, 0), C(M, 0), G(M, 0), T(M, 0) {}

	vector<complex<long double>> A, C, G, T;
};

void dfft(vector<complex<long double>>& vec, bool inv) {
	int sz = vec.size(), bit;
	for (int i = 1, j = 0; i < sz; i++) {
		bit = sz >> 1;
		for (; j >= bit; bit >>= 1)
			j -= bit;
		j += bit;
		if (i < j)
			swap(vec[i], vec[j]);
	}
	for (int len = 2; len <= sz; len <<= 1) {
		long double ang = 2 * M_PI / len * (inv ? -1 : 1);
		complex<long double> wlen(cos(ang), sin(ang));
		for (int i = 0; i < sz; i += len) {
			complex<long double> w(1);
			for (int j = 0; j < len >> 1; j++) {
				complex<long double> u = vec[i + j], v = w * vec[i + j + (len >> 1)];
				vec[i + j] = u + v;
				vec[i + j + (len >> 1)] = u - v;
				w *= wlen;
			}
		}
	}
	if (inv)
		for (int i = 0; i < sz; i++)
			vec[i] /= sz;
}

void parse(const string & s, DNA & d) {
	int t = 0;

	for (auto it = s.begin(); it != s.end(); it++, t++)
		if (*it == 'A')
			d.A[t] = 1;
		else if (*it == 'G')
			d.G[t] = 1;
		else if (*it == 'C')
			d.C[t] = 1;
		else if (*it == 'T')
			d.T[t] = 1;
}


int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int M;
	string s1, s2;
	cin >> M >> s1 >> s2;
	reverse(s1.begin(), s1.end());
	DNA first(M << 1), second(M << 1);
	parse(s1, first), parse(s2, second);

	vector<complex<long double>> a_mul(M << 1, 0), c_mul(M << 1, 0), g_mul(M << 1, 0), t_mul(M << 1, 0);
	vector<unsigned long long int> a_real(M << 1, 0), c_real(M << 1, 0), g_real(M << 1, 0), t_real(M << 1, 0);

	vector<unsigned long long> result(M, 0);

	for (int i = 0; i < M; i++) {
		second.A[M + i] = second.A[i];
		second.C[M + i] = second.C[i];
		second.G[M + i] = second.G[i];
		second.T[M + i] = second.T[i];
	}

	dfft(first.A, false), dfft(second.A, false);
	dfft(first.C, false), dfft(second.C, false);
	dfft(first.G, false), dfft(second.G, false);
	dfft(first.T, false), dfft(second.T, false);

	for (int i = 0; i < M << 1; i++) {
		a_mul[i] = first.A[i] * second.A[i];
		c_mul[i] = first.C[i] * second.C[i];
		g_mul[i] = first.G[i] * second.G[i];
		t_mul[i] = first.T[i] * second.T[i];
	}

	dfft(a_mul, true); dfft(c_mul, true);
	dfft(g_mul, true); dfft(t_mul, true);

	for (int i = 0; i < M << 1; i++) {
		a_real[i] = (unsigned long long int) (a_mul[i].real() + 0.5);
		c_real[i] = (unsigned long long int) (c_mul[i].real() + 0.5);
		g_real[i] = (unsigned long long int) (g_mul[i].real() + 0.5);
		t_real[i] = (unsigned long long int) (t_mul[i].real() + 0.5);
	}

	for (int i = M; i < M << 1; i++) {
		unsigned long long int t = a_real[i] + c_real[i] + g_real[i] + t_real[i];
		result[i - M] = t;
	}

	cout << *max_element(result.begin(), result.end()) << ' ';
	cout << ((result.end() - max_element(result.begin(), result.end()) - 1) % M);
	return 0;
}