#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <set>
#include <vector>

const int N = 1000000 + 5;

int n, las;
int a[N];
char str[N];
std::set<int> s, mp[1 << 20];

inline void mdf(int x, int v) {
  while (x <= n) {
    a[x] += v;
    x += x & -x;
  }
}
inline int qry(int x) {
  int res = 0;
  while (x) {
    res += a[x];
    x -= x & -x;
  }
  return res;
}

int np, pos[N];
void rebuild() {
  np = 0;
  for (int i = 0; i < (1 << las); ++i) mp[i].clear();
  int var = 0;
  for (auto it = s.begin(); it != s.end(); ++it) {
    pos[np++] = *it;
    var = var * 2 + str[*it] - '0';
    var %= (1 << las);
    if (np >= las) {
      mp[var].insert(mp[var].end(), pos[np - las]);
    }
  }
}
void del() {
  int var = 0;
  for (int i = 0; i < np; ++i) {
    int p = pos[i];
    var = var * 2 + str[p] - '0';
    var %= (1 << las);
    if (i + 1 >= las)
      mp[var].erase(pos[i - las + 1]);
  }
}

int tp, st[N];
void add() {
  int var = 0;
  for (int i = 0; i < tp; ++i) {
    int p = st[i];
    var = var * 2 + str[p] - '0';
    var %= (1 << las);
    if (i + 1 >= las)
      mp[var].insert(st[i - las + 1]);
  }
}

int main() {
  scanf("%d%s", &n, str + 1);
  for (int i = 1; i <= n; ++i) {
    mdf(i, 1);
    s.insert(s.end(), i);
  }
  for (int i = 1; i <= n; ++i) {
    int len = 32 - __builtin_clz(i);
    if (len != las) {
      las = len;
      rebuild();
    }
    if (mp[i].size() == 0) {
      puts("-1 0");
      continue;
    }
    auto &cur = mp[i];
    printf("%d %d\n", qry(*cur.begin()), int(cur.size()));
    int p = *cur.begin();
    np = 0;
    auto it = s.find(p), bck = it;
    for (int j = 1; j <= las - 1 && it != s.begin(); ++j) {
      --it;
      pos[np++] = *it;
    }
    std::reverse(pos, pos + np);
    std::copy(pos, pos + np, st), tp = np;
    it = bck;
    for (int j = 1; j <= las + las - 1 && it != s.end(); ++j) {
      pos[np++] = *it;
      if (j <= las) {
        mdf(*it, -1);
        it = s.erase(it);
      } else {
        st[tp++] = *it;
        ++it;
      }
    }
    del();
    add();
  }
  return 0;
}