#include <bits/stdc++.h>
using namespace std;
const int N = 4e6 + 10;
char str[N], s[N];
int f[N], ans[N];
int main() {
  int n;
  scanf("%d%s", &n, str);
  for (int i = 1; i <= n * 4 + 1; i++) {
    if (i & 1)
      s[i] = '#';
    else if (i >> 1 & 1)
      s[i] = str[i >> 2];
    else
      s[i] = str[n - (i >> 2)];
  }
  int mid = 0, r = 0;
  for (int i = 1; i <= n * 4 + 1; i++) {
    f[i] = i < r ? min(r - i, f[mid * 2 - i]) : 1;
    while (f[i] < i && i + f[i] <= n * 4 + 1 && s[i - f[i]] == s[i + f[i]])
      f[i]++;
    if (f[i] + i - 1 > r) r = f[i] + i - 1, mid = i;
  }
  for (int i = 1; i <= n * 2; i++) ans[i] = -1;
  for (int i = 1; i <= n * 2; i++)
    if (i & 1) {
      if (f[i] == 1) continue;
      if (f[i] >> 1 & 1 ^ 1) f[i] -= 2;
      if (f[i] >> 1 & 1)
        ans[(i - f[i] + 2) >> 1] = max(ans[(i - f[i] + 2) >> 1], f[i] >> 1);
    }
  for (int i = 2; i <= n; i++) ans[i] = max(ans[i], ans[i - 2] - 2);
  for (int i = 1; i <= n; i += 2) printf("%d ", ans[i]);
  return 0;
}
