#include<bits/stdc++.h>
#define db double
#define LL long long
#define pb push_back
#define eb emplace_back
#define pli pair<LL,int>
#define pii pair<int,int>
#define fr first
#define sc second
#define mp make_pair
using namespace std;
const int dx[]={0,1,0,-1,1,1,-1,-1},
		  dy[]={1,0,-1,0,1,-1,1,-1};

struct BIT
{
	int n;
	vector<int> tr;
	BIT(int N)
	{
		tr.resize((n=N)+10);
	}
	void upd(int i) {for(;i<=n;i+=(i&-i)) tr[i]++;}
	int qry(int i) {int res=0; for(;i;i-=(i&-i)) res+=tr[i]; return res;}
};
int n;
void solve()
{
	cin>>n;
	string s;cin>>s;s=" "+s;
	vector<int> a(n+10),f(n+10),ex(n+10,1),nxt(n+10),pre(n+10),cnt(n*2+10);
	vector<priority_queue<int,vector<int>,greater<int>>> pos(n*2+10),del(n*2+10);
	nxt[n+1]=n+1;nxt[0]=1;pre[n+1]=n;
	for(int i=1;i<=n;++i) a[i]=s[i]-'0',nxt[i]=i+1,pre[i]=i-1;
	BIT T(n);
	for(int k=1,x=1;x<=n;++k,x<<=1)
	{
		int S=(1<<k)-1;
		{
			int p=nxt[0],ps=p,x=0;
			for(int j=1;j<k;++j,ps=nxt[ps]) x=x<<1|a[ps];
			for(;ps<=n;p=nxt[p],ps=nxt[ps])
			{
				x=((x<<1)&S)|a[ps];
				f[p]=x;
				cnt[f[p]]++;pos[f[p]].push(p);
			}
			for(;p<=n;p=nxt[p]) f[p]=0;
		}
//		cout<<'\n';
		for(int i=x;i<=n&&i<(x<<1);++i)
		{
//			cout<<cnt[7]<<'\n';
			if(!cnt[i])
			{
				cout<<"-1 0\n";
				continue;
			}
			while(!del[i].empty()&&pos[i].top()==del[i].top())
			{
				pos[i].pop();
				del[i].pop();
			}
			int P=pos[i].top(),p=P;
			cout<<p-T.qry(p)<<' '<<cnt[i]<<'\n';
			for(int j=1;j<=k;++j,p=nxt[p])
			{
				ex[p]=0;
				T.upd(p);
				cnt[f[p]]--;
				del[f[p]].push(p);
				f[p]=0;
			}
			nxt[pre[P]]=p;pre[p]=pre[P];
			p=P;
			for(int j=1;j<k;++j) p=pre[p];
			if(!p) p=nxt[p];
			int x=0,ps=p;
			for(int j=1;j<k;++j,ps=nxt[ps]) x=x<<1|a[ps];
			for(int j=1;j<k;++j,p=nxt[p],ps=nxt[ps])
			{
				if(f[p])
				{
					cnt[f[p]]--;
					del[f[p]].push(p);
				}
				if(ps<=n)
				{
					x=((x<<1)&S)|a[ps];
					f[p]=x;
					cnt[f[p]]++;pos[f[p]].push(p);
				}
			}
		}
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int TT=1;
//	cin>>TT;
	for(;TT;--TT) solve();
	return 0;
}