#include <bits/stdc++.h>
using namespace std;
char s[1000010];
int fv[1000010][2];
int hv[1000010][2];
int ans[1000010];
int n;
void pre() {
  fv[0][0] = fv[0][1] = 1;
  for (int i = 1; i <= n; i++) {
    fv[i][0] = 1LL * fv[i - 1][0] * 37 % 1000000007;
    hv[i][0] = (1LL * hv[i - 1][0] * 37 + s[i] - 'a' + 1) % 1000000007;
    fv[i][1] = 1LL * fv[i - 1][1] * 31 % 998244353;
    hv[i][1] = (1LL * hv[i - 1][1] * 31 + s[i] - 'a' + 1) % 998244353;
  }
}
pair<int, int> calc(int L, int R) {
  return pair<int, int>(
      ((hv[R][0] - 1LL * hv[L - 1][0] * fv[R - L + 1][0]) % 1000000007 +
       1000000007) %
          1000000007,
      ((hv[R][1] - 1LL * hv[L - 1][1] * fv[R - L + 1][1]) % 998244353 +
       998244353) %
          998244353);
}
int main() {
  scanf("%d%s", &n, s + 1);
  pre();
  int st = -1;
  for (int i = (n + 1) / 2; i >= 1; i--) {
    st += 2;
    st = min(st, n - 2 * i + 1);
    if (st % 2 == 0) st--;
    while (st > 0) {
      if (calc(i, i + st - 1) == calc(n + 1 - i - st + 1, n + 1 - i)) break;
      st -= 2;
    }
    if (st > 0)
      ans[i] = st;
    else
      ans[i] = -1;
  }
  for (int i = 1; i <= (n + 1) / 2; i++) printf("%d ", ans[i]);
}
