#include <bits/stdc++.h>
using namespace std;
int n;
unsigned long long h[1100000];
unsigned long long power[1100000];
char s[1100000];
int r[1100000];
unsigned long long query(int L, int R) {
  return (h[R] - h[L - 1] * power[R - L + 1] % 1000000007 + 1000000007) %
         1000000007;
}
int main() {
  scanf("%d", &n);
  scanf("%s", s + 1);
  power[0] = 1;
  for (int i = 1; i <= n; i++) {
    h[i] = (h[i - 1] * 107 + s[i]) % 1000000007;
    power[i] = (power[i - 1] * 107) % 1000000007;
  }
  for (int i = 1; i <= n / 2; i++) {
    int L = 1, R = i;
    if (s[i] != s[n + 1 - i]) continue;
    while (L != R) {
      int mid = (L + R + 1) / 2;
      if (query(i - mid + 1, i + mid - 1) ==
          query(n + 1 - i - mid + 1, n + 1 - i + mid - 1))
        L = mid;
      else
        R = mid - 1;
    }
    r[i - L + 1] = max(r[i - L + 1], i);
  }
  for (int i = 1, j = 0; i <= n / 2; i++) {
    j = max(j, r[i]);
    if (j < i)
      printf("%d ", -1);
    else
      printf("%d ", (j - i) * 2 + 1);
  }
  if (n & 1) printf("-1");
  return 0;
}
