#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
using LL = long long;
priority_queue<int, vector<int>, greater<int> > q[1 << 20], del[1 << 20];
int cnt[1 << 20];
int l[1 << 20], r[1 << 20];

int tr[1 << 20];

int lowbit(int x){
    return x & -x;
}

void modify(int x, int v){
    while(x < (1 << 20)){
        tr[x] += v;
        x += lowbit(x);
    }
}

int query(int x){
    int ans = 0;
    while(x){
        ans += tr[x];
        x -= lowbit(x);
    }
    return ans;
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n;
    string str;
    cin >> n >> str;
    str = " " + str;
    for(int i = 1; i <= n; i++){
        l[i] = i - 1;
        r[i] = i + 1;
    }
    r[0] = 1;
    l[n + 1] = n;

    for(int i = 1; i <= n; i++){
        modify(i, 1);
    }

    for(int len = 1; len <= __lg(n) + 1; len++){
        int L = (1 << (len - 1)), R = min((1 << len) - 1, n);
        const int mask = (1 << len) - 1;
        {
            int j = r[0], val = 0;
            for(int _ = 0; _ + 1 < len and j <= n; _++){
                val = val * 2 + str[j] - '0';
                j = r[j];
            }
            for(int i = r[0]; j <= n; i = r[i]){
                val = val * 2 + str[j] - '0';
                val &= mask;
                if (val >= L and val <= R){
                    q[val].push(i);
                    cnt[val] += 1;
                }
                j = r[j];
            }
        }
        for(int i = L; i <= R; i++){
            if (cnt[i] == 0){
                cout << -1 << ' ' << 0 << '\n';
                continue;
            }
            while(!q[i].empty() and !del[i].empty()){
                int t1 = q[i].top();
                int t2 = del[i].top();
                if (t1 == t2){
                    q[i].pop();
                    del[i].pop();
                }
            }
            cout << query(q[i].top()) << ' ' << cnt[i] << '\n';
            // cout << query(*s[i].begin()) << ' ' << s[i].size() << '\n';
            // int tt = query(*s[i].begin());
            // cout << "? " << (*s[i].begin()) << ' ' << query(*s[i].begin()) << '\n';
            int p1 = q[i].top();
            cnt[i] -= 1;
            q[i].pop();
            int p2 = p1;
            for(int j = 0; j < len; j++) p2 = r[p2];
            int p0 = p1;
            for(int j = 0; j < len and p0; j++) p0 = l[p0];
            {
                int k = r[p0], val = 0;
                for(int _ = 0; _ + 1 < len and k <= n; _++){
                    val = val * 2 + str[k] - '0';
                    k = r[k];
                }
                for(int j = r[p0]; j != p2 and k <= n; j = r[j]){
                    val = val * 2 + str[k] - '0';
                    val &= mask;
                    if (val >= L and val <= R){
                        del[val].push(j);
                        cnt[val] -= 1;
                    }
                    k = r[k];
                }
            }

            for(int j = p1; j != p2; j = r[j]){
                modify(j, -1);
            }
            r[l[p1]] = p2;
            l[p2] = l[p1];

            {
                int k = r[p0], val = 0;
                for(int _ = 0; _ + 1 < len and k <= n; _++){
                    val = val * 2 + str[k] - '0';
                    k = r[k];
                }
                for(int j = r[p0]; j != p2 and k <= n; j = r[j]){
                    val = val * 2 + str[k] - '0';
                    val &= mask;
                    if (val >= L and val <= R){
                        q[val].push(j);
                        cnt[val] += 1;
                    }
                    k = r[k];
                }
            }
        }
        // for(int i = L; i <= R; i++) s[i].clear();
    }

}