#include<bits/stdc++.h>
using namespace std;
typedef priority_queue<int,vector<int>,greater<int> >PQ;
const int N=1048577;
int n,m;
char s[N];
int pre[N],nxt[N],a[N];
int B[N];
inline void add(int i,int x){for(;i<=n;i+=i&-i)B[i]+=x;}
inline int ask(int i){int x=0;for(;i;i&=i-1)x+=B[i];return x;}
PQ P[N],Q[N];
int main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>n;
    cin>>(s+1);
    m=n;
    for(int w=1,len=1;w<=n;w<<=1,++len){
        memset(B,0,sizeof B);
        int mask=(1<<len)-1;
        for(int i=1;i<=m;++i)nxt[i]=i+1,pre[i]=i-1;
        nxt[0]=1,pre[m+1]=m;
        a[1]=0;
        for(int i=1;i<=len;++i)a[1]=a[1]*2+(s[i]-'0');
        for(int i=2;i<=m-len+1;++i)
            a[i]=(a[i-1]<<1|(s[i+len-1]-'0'))&mask;
        for(int i=1;i<=m-len+1;++i)
            Q[a[i]].emplace(i);
        int del=0;
        for(int i=w;i<2*w&&i<=n;++i){
//			cerr<<"QWQ"<<":"<<i<<" "<<m<<endl;
            if(len>m-del||Q[i].size()==P[i].size()){
                cout<<"-1 0\n";
                Q[i]=P[i]=PQ();
                continue;
            }
            del+=len;
            while(P[i].size()&&Q[i].top()==P[i].top())Q[i].pop(),P[i].pop();
            int pos=Q[i].top();
            cout<<pos-ask(pos)<<" "<<Q[i].size()-P[i].size()<<'\n';
            Q[i]=P[i]=PQ();
            int np=pos,pr=pre[pos];
            add(pos,len);
            for(int j=1;j<=len;++j){
                if(a[np]>i)P[a[np]].emplace(np),a[np]=0;
                np=nxt[np];
            }
            nxt[pr]=np,pre[np]=pr;
            if(len>m-del)continue;
            for(int i=1;i<=len;++i)pr=pre[pr];
            if(pr==0)pr=nxt[pr];
            np=pr;
            if(a[pr]>i)P[a[pr]].emplace(pr),a[pr]=0;
            a[pr]=0;
            for(int i=1;i<=len;++i){
                a[pr]=a[pr]<<1|(s[np]-'0');
                np=nxt[np];
            }
            if(a[pr]>i)Q[a[pr]].emplace(pr);
            for(int i=1;i<=len+1;++i){
                pr=nxt[pr];
                if(pr>m)break;
                if(a[pr]>i)P[a[pr]].emplace(pr),a[pr]=0;
                if(np<=m){
                    a[pr]=(a[pre[pr]]<<1|(s[np]-'0'))&mask;
                    np=nxt[np];
                    if(a[pr]>i)Q[a[pr]].emplace(pr);
                }
            }
//			for(int i=nxt[0];i<=m;i=nxt[i])cerr<<s[i];
//			cerr<<endl;
        }
        static char tt[N];
        int nlen=0;
        for(int i=nxt[0];i<=m;i=nxt[i]){
            tt[++nlen]=s[i];
        }
        m=nlen;
        for(int i=1;i<=m;++i)s[i]=tt[i];
    }
    return 0;
}