#include <bits/stdc++.h>

using namespace std;

int main() {
    int k;
    cin >> k;
    string s;
    cin >> s;
    int n = s.size();
    // cnt1 / cnt0 -> max
    long double l = 0, r = n + 1;
    int ans_i = 1, ans_len = k;
    while (r - l > 0.0001) {
        long double mid = (l + r) / 2;
        vector<long double> pref(n + 1);
        pref[0] = 0;
        long double mn = 1e18;
        int ind_mn = -1;
        bool ok = false;
        for (int i = 1; i <= n; ++i) {
            long double now = 0;
            if (s[i - 1] == '1')
                now = 1;
            else
                now = -mid;
            pref[i] = pref[i - 1] + now;
            if (i >= k)
                if (pref[i - k] < mn) {
                    mn = pref[i - k];
                    ind_mn = i - k;
                }
            if (pref[i] - mn >= 0) {
                ok = true;
                ans_i = ind_mn + 1;
                ans_len = i - ans_i + 1;
            }
        }
        if (ok)
            l = mid;
        else
            r = mid;
    }
    cout << ans_i << ' ' << ans_len;
}