#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <bitset>
#include <iterator>
#include <iomanip>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <random>
#include <cassert>

using namespace std;

// #define int long long
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

typedef long long ll;
typedef long double ld;

bool check(int len1, int cnt1, int len2, int cnt2) {
    return cnt1 * len2 < cnt2 * len1;
}

void solve() {
    int k;
    cin >> k;
    string s;
    cin >> s;
    int n = s.size();
    vector<int> p(n + 1);
    for (int i = 0; i < n; ++i) p[i + 1] = p[i] + s[i] - '0';
    vector<bool> ok(n + 1, 1);
    int ansind = 0, anslen = k, cnt = 0;
    for (int i = k; i <= n; ++i) {
        if (ok[i]) {
            for (int j = i; j <= n; j += i) ok[j] = 0;
            for (int s = 0; s + i <= n; ++s) {
                if (check(anslen, cnt, i, p[s + i] - p[s])) {
                    ansind = s;
                    anslen = i;
                    cnt = p[s + i] - p[s];
                }
            }
        }
    }
    cout << ansind + 1 << ' ' << anslen;
}

signed main() {
    int tc = 1;
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#else
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#endif
    // cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t  << ": ";
        solve();
    }
}