#include <bits/stdc++.h>
const int N = 1e6 + 5;
const long long BASE = 127;
const long long MOD = 998244353;
char s[N];
long long HASH[N], HFac[N];
int ans[N];
int n, cnt = 0, l, r, len = 1;
long long get_hash(int l, int len) {
  return (HASH[l + len - 1] + MOD - (HASH[l - 1] * HFac[len]) % MOD) % MOD;
}
void pre() {
  HFac[0] = 1;
  for (int i = 1; i <= n; i++) HFac[i] = (HFac[i - 1] * BASE) % MOD;
  HASH[0] = 0;
  for (int i = 1; i <= n; i++)
    HASH[i] = ((HASH[i - 1] * BASE) % MOD + s[i] - 'a') % MOD;
}
int main() {
  scanf("%d %s", &n, s + 1);
  pre();
  if (n & 1)
    l = r = n / 2 + 1;
  else
    l = n / 2, r = l + 1;
  while (r <= n && l >= 1) {
    while ((len != -1 && get_hash(l, len) != get_hash(r - len + 1, len)) ||
           (len >= r - l + 1))
      len -= 2;
    ans[++cnt] = len;
    l--;
    r++;
    len += 2;
  }
  for (int i = cnt; i; i--) printf("%d%c", ans[i], n == i ? '\n' : ' ');
  return 0;
}
