#include <bits/stdc++.h>
using namespace std;
void read(int &x) {
  int v = 0, f = 1;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-')
    f = -1;
  else
    v = v * 10 + c - '0';
  while (isdigit(c = getchar())) v = v * 10 + c - '0';
  x = v * f;
}
void read(long long &x) {
  long long v = 0ll, f = 1ll;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-')
    f = -1;
  else
    v = v * 10 + c - '0';
  while (isdigit(c = getchar())) v = v * 10 + c - '0';
  x = v * f;
}
void readc(char &x) {
  char c;
  while ((c = getchar()) == ' ')
    ;
  x = c;
}
void writes(string s) { puts(s.c_str()); }
void writeln() { writes(""); }
void writei(int x) {
  if (x < 0) {
    putchar('-');
    x = abs(x);
  }
  if (!x) putchar('0');
  char a[25];
  int top = 0;
  while (x) {
    a[++top] = (x % 10) + '0';
    x /= 10;
  }
  while (top) {
    putchar(a[top]);
    top--;
  }
}
void writell(long long x) {
  if (x < 0) {
    putchar('-');
    x = abs(x);
  }
  if (!x) putchar('0');
  char a[25];
  int top = 0;
  while (x) {
    a[++top] = (x % 10) + '0';
    x /= 10;
  }
  while (top) {
    putchar(a[top]);
    top--;
  }
}
inline long long inc(int &x) { return ++x; }
inline long long inc(long long &x) { return ++x; }
inline long long inc(int &x, long long y) { return x += y; }
inline long long inc(long long &x, long long y) { return x += y; }
inline double inc(double &x, double y) { return x += y; }
inline long long dec(int &x) { return --x; }
inline long long dec(long long &x) { return --x; }
inline long long dec(int &x, long long y) { return x -= y; }
inline long long dec(long long &x, long long y) { return x -= y; }
inline double dec(double &x, double y) { return x -= y; }
inline long long mul(int &x) { return x = ((long long)x) * x; }
inline long long mul(long long &x) { return x = x * x; }
inline long long mul(int &x, long long y) { return x *= y; }
inline long long mul(long long &x, long long y) { return x *= y; }
inline double mul(double &x, double y) { return x *= y; }
inline long long divi(const int &x) {
  long long ans, l, r, mid;
  ans = 0;
  l = 0;
  r = 0x3fffffff;
  while (l < r) {
    mid = (l + r) / 2;
    if (mid * mid <= x) {
      ans = mid;
      l = mid + 1;
    } else
      r = mid;
  }
  return ans;
}
inline long long divi(const long long &x) {
  long long ans, l, r, mid;
  ans = 0;
  l = 0;
  r = 0x3fffffff;
  while (l < r) {
    mid = (l + r) / 2;
    if (mid * mid <= x) {
      ans = mid;
      l = mid + 1;
    } else
      r = mid;
  }
  return ans;
}
inline long long divi(int &x, long long y) { return x /= y; }
inline long long divi(long long &x, long long y) { return x /= y; }
inline double divi(double &x, double y) { return x /= y; }
inline long long mod(int &x, long long y) { return x %= y; }
inline long long mod(long long &x, long long y) { return x %= y; }
int n, m, i, j, dp[1000005], l, r, mid, ans;
string st;
char ss[1000005];
long long h[1000005][2], p[1000005][2], e[2] = {31, 131}, wyx = 1e9 + 7;
pair<long long, long long> gth(int x, int y) {
  return make_pair(
      ((h[y][0] - h[x - 1][0] * p[y - x + 1][0]) % wyx + wyx) % wyx,
      ((h[y][1] - h[x - 1][1] * p[y - x + 1][1]) % wyx + wyx) % wyx);
}
int main() {
  scanf("%d", &n);
  scanf(" %s", ss);
  st = ss;
  st = " " + st;
  p[0][0] = p[0][1] = 1;
  memset(dp, -1, sizeof(dp));
  if ((1) <= ((n)))
    for (((i)) = (1); ((i)) <= ((n)); ((i))++) {
      if ((0) <= (1))
        for ((j) = (0); (j) <= (1); (j)++) {
          p[i][j] = p[i - 1][j] * e[j] % wyx;
          (h[i][j] = h[i - 1][j] * e[j] + st[i]) %= wyx;
        }
    }
  if ((1) <= ((n / 2)))
    for (((i)) = (1); ((i)) <= ((n / 2)); ((i))++) {
      l = 1;
      r = i + 1;
      ans = 0;
      while (l < r) {
        mid = (l + r) / 2;
        if (gth(i - mid + 1, i + mid - 1) ==
            gth((n - i + 1) - mid + 1, (n - i + 1) + mid - 1)) {
          ans = mid;
          l = mid + 1;
        } else
          r = mid;
      }
      dp[i - ans + 1] = max(dp[i - ans + 1], ans + ans - 1);
    }
  if ((1) <= ((n / 2)))
    for (((i)) = (1); ((i)) <= ((n / 2)); ((i))++) {
      printf("%d ", dp[i] = max(dp[i], dp[i - 1] - 2));
    }
  if (n & 1) puts("-1");
  return 0;
}
