#include <bits/stdc++.h>
#pragma optimize "DostSeferoğlu"
#pragma GCC optimize("unroll-loops,Ofast")
#pragma GCC target("avx2,tune=native")
using namespace std;
#define int long long
#define pii pair<int,int>
#define bg begin
#define vi vector<int>
#define endl '\n'
#define vvi vector<vi>
#define pc __builtin_popcountll
#define vp vector<pii>
#define sp << " " <<
#define all(x) x.bg()+1,x.end()
#define ff first
#define ss second
#define brake {cout << "OK\n";return;}
#define debug(x) {cout << #x << ": "; for (auto it : x) cout << it << " ";cout << endl;}
#define FF(xxx,sss,yyy) for (int xxx=sss;xxx<=yyy;++xxx)
#define F(xx,yy) for (int xx=1;xx<=yy;++xx)
#define pb push_back
const int inf = 1e18;
const int MOD = 998244353;
const int N = 1e5+1;
vi tree(4*N);
string s;
void build(int node,int l,int r) {
if (l == r) {
tree[node] = (1<<(s[l-1]-'a'));
return;
}
int m = (l+r) >> 1;
build(2*node,l,m);
build(2*node+1,m+1,r);
tree[node] = tree[2*node]|tree[2*node+1];
}
int query(int node,int l,int r,int L,int R) {
if (l > R || r < L) return 0;
if (l >= L && r <= R) return tree[node];
int m = (l+r) >> 1;
return query(2*node,l,m,L,R)|query(2*node+1,m+1,r,L,R);
}
void solve() {
int n;
cin >> n;
cin >> s;
build(1,1,n);
double best = 1;
pii ans;
for (int x = 1;x<=26;x++) {
for (int i=1;i<=n;i++){
int l = i;
int r = n;
while (l<=r) {
int m = (l+r) >> 1;
if (pc(query(1,1,n,i,m)) <= x) l = m+1;
else r = m-1;
}
double v = (double)x/(r-i+1);
if (best > v) {
best = v;
ans = {i,r};
}
}
}
cout << ans.ff sp ans.ss << endl;
}
signed main() {
ios_base::sync_with_stdio(0);cin.tie(0);
#ifdef Local
freopen("input.in", "r", stdin);
freopen("input.out", "w", stdout);
#endif
int t = 1;
//cin >> t;
while (t --> 0) solve();
}
