#include <bits/stdc++.h>
using namespace std;
int n, cnt = 1, p, fail[2000005], dfail[2000005], nxt[2000005][26],
       len[2000005], pos[2000005];
char s[1000005], a[2000005];
inline void extend(int x) {
  int c = a[x] - 'a';
  while (a[x - len[p] - 1] != a[x]) p = fail[p];
  if (!nxt[p][c]) {
    int cur = ++cnt, k = fail[p];
    len[cur] = len[p] + 2;
    while (a[x - len[k] - 1] != a[x]) k = fail[k];
    fail[cur] = nxt[k][c];
    if (len[fail[cur]] % 2 == 0 && (len[fail[cur]] / 2) % 2 == 1)
      dfail[cur] = fail[cur];
    else
      dfail[cur] = dfail[fail[cur]];
    nxt[p][c] = cur;
  }
  p = nxt[p][c];
}
int main(void) {
  register int i, j, t;
  scanf("%d", &n), scanf("%s", s + 1);
  for (i = 1; i <= n; ++i) a[i * 2 - 1] = s[i], a[i * 2] = s[n - i + 1];
  n <<= 1, fail[0] = fail[1] = 1, len[1] = -1;
  for (i = 1; i <= n; ++i) extend(i), pos[i] = p;
  memset(nxt, 0, sizeof(nxt));
  for (i = 1; i <= n; ++i) {
    nxt[i][0] = dfail[i];
    for (j = 1; j <= 20; ++j) nxt[i][j] = nxt[nxt[i][j - 1]][j - 1];
  }
  for (i = n, t = n; i > n / 2; i -= 2, t -= 4) {
    int o = pos[i];
    for (j = 20; ~j; --j)
      if (len[nxt[o][j]] >= t) o = nxt[o][j];
    o = dfail[o];
    printf("%d ", o ? len[o] / 2 : -1);
  }
  return 0;
}
