// what is matter? never mind. 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 1100005
// 1024576
#define inf 0x3f3f3f3f

int n;
char str[maxn];
int a[maxn],L[maxn],R[maxn];

struct bit{
    vector<int>tr;
    int n;
    void init(int N){n=N,tr=vector<int>(N+1,0);}
    void add(int x,int y){for(;x<=n;x+=x&-x)tr[x]+=y;}
    int ask(int x){
        int s=0;
        for(;x;x^=x&-x)s+=tr[x];
        return s;
    }
    void down(){For(i,1,n)tr[i]+=tr[i^(i&-i)];}
}tr;

set<int>st[maxn];
int res[maxn],sum[maxn],all;

int t[maxn],len;
void rebuild(int k){
    int s=0,len=0;
    for(int i=R[0];i<=n;i=R[i]) t[++len]=i;
//	cout<<"build "<<k<<endl;
//	For(i,1,len)cout<<t[i]<<" "; cout<<"\n";
    For(i,1,len){
        s=((s<<1)|(a[t[i]]))&((1<<k)-1);
        if(i>=k && s>=((1<<(k-1)))) st[s].insert(t[i-k+1]);//cout<<"s: "<<s<<" "<<t[i-k+1]<<endl;
    }
}
int t2[maxn],len2;
void del(int u,int k){
    len=0;
    for(int x=u; x>=1 && len<=k ;x=L[x]) t[++len]=x;
    reverse(t+1,t+len+1);
    
    int fr=len;
    int llen=0;
    for(int x=R[u];x<=n+1 && llen<k*2; x=R[x],++llen) t[++len]=x;
    
//	For(i,1,len)cout<<t[i]<<" "; cout<<"\n";
    
    int frm=t[1],lst=t[len];
    int s=0;
    For(i,1,len){
        if(t[i]>n)break;
        s=((s<<1)|(a[t[i]]))&((1<<k)-1);
        if(i>=k && s>=((1<<(k-1)))) st[s].erase(t[i-k+1]);
    }
    
    For(i,fr,fr+k-1) tr.add(t[i],-1);//cout<<"del "<<t[i]<<"\n";
//	cout<<"link "<<t[fr-1]<<" "<<t[fr+k]<<'\n';
    R[t[fr-1]]=t[fr+k]; L[t[fr+k]]=t[fr-1];
    len2=0;
    For(i,1,len)
        if(i>=fr && i<=fr+k-1) ;
        else t2[++len2]=t[i];
    For(i,1,len2)t[i]=t2[i]; len=len2;
    
//	For(i,1,len)cout<<t[i]<<" "; cout<<"\n";
    
    s=0;
    For(i,1,len){
        if(t[i]>n)break;
        s=((s<<1)|(a[t[i]]))&((1<<k)-1);
        if(i>=k && s>=((1<<(k-1)))) st[s].insert(t[i-k+1]);
    }
}

signed main()
{
    n=read();
    scanf("%s",str);
    For(i,1,n)a[i]=(str[i-1]&1);
    tr.init(n);
    For(i,1,n)tr.add(i,1),L[i]=i-1,R[i]=i+1;
    all=n;
    R[0]=1,L[n+1]=n;
    for(int k=1,l=1,r=1; l<=n ;k++,l*=2,r=r*2+1){
        r=min(r,n);
        rebuild(k);
        For(i,l,r){
            sum[i]=st[i].size();
            if(!st[i].size()){
                res[i]=-1;
                continue;
            }
            res[i]=tr.ask(*st[i].begin());
        //	cout<<"i: "<<i<<" "<<res[i]<<"\n";
            del(*st[i].begin(),k);
        }
        For(i,l,r) st[i].clear();
    }
    For(i,1,n)printf("%d %d\n",res[i],sum[i]);
    //cout<<res[i]<<" "<<sum[i]<<"\n";
    return 0;
}
/*

*/