#include <bits/stdc++.h>
#include <time.h>
//#include <random>
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 100500 / 100
#define oo ll(1e16)
#define pii pair <int, int>
#define pll pair <ll, ll>
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
#define re return
#define nins 4294967295
using namespace std;
typedef long long ll;
typedef long double ld;
//mt19937 rnd(0);
void solve() {
int n, lst[30] {}, res = 1, l = 1, r = 1;
set <int> st;
st.clear();
string s;
st.insert(0);
cin >> n;
cin >> s;
for (int i = 1; i <= n; i++) {
int c = s[i - 1] - 'a';
if (lst[c])
st.erase(-lst[c]);
st.insert(-i);
lst[c] = i;
int cur = 0;
for (set <int> :: iterator it = st.begin(); it != st.end(); it++) {
if (cur && (cur * (r - l + 1) < (i + (*it)) * res)) {
l = -(*it) + 1;
r = i;
res = cur;
}
cur++;
}
}
cout << l << ' ' << r;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef _LOCAL
in("input.txt");
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
cout << "Test #" << i << elf;
clock_t start_time = clock();
solve();
cerr.precision(4); cerr << fixed;
cerr << elf;
cerr << "Time :: " << ld(clock() - start_time) / CLOCKS_PER_SEC << elf;
cout << elf;
}
#else
int t = 1;
// cin >> t;
while (t--) {
solve();
cout << el;
}
#endif
}
