#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1, c = getchar();
  while (c < 48) c == '-' && (f = -1), c = getchar();
  while (c > 47) x = x * 10 + c - '0', c = getchar();
  return x * f;
}
const int mod = 1e9 + 7;
const int MAXN = 1000005;
long long h[MAXN], pw[MAXN], ans[MAXN];
long long n, len;
char s[MAXN];
inline long long gethash(int l, int r) {
  return (h[r] - h[l - 1] * pw[r - l + 1] % mod + mod) % mod;
}
int main(int argc, char const *argv[]) {
  n = read();
  scanf("%s", s + 1);
  for (int i = pw[0] = 1; i <= n; ++i) {
    pw[i] = pw[i - 1] * 131 % mod;
    h[i] = (h[i - 1] * 131 + s[i] - 'a') % mod;
  }
  memset(ans, -1, sizeof ans);
  len = (n + 1) >> 1;
  for (int i = len, j; i; --i)
    if ((j = n - i + 1, 1) && i == j)
      ans[i] = -1;
    else
      for (ans[i] = ans[i + 1] + 2; ~ans[i]; ans[i] -= 2)
        if (gethash(i, i + ans[i] - 1) == gethash(j - ans[i] + 1, j)) break;
  for (int i = 1; i <= len; ++i) printf("%lld%c", ans[i], " \n"[i == n]);
  return 0;
}
