#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll N=1e6+3,H=1e9+97;
int n,kmp[N],f[N];
char ch[N];
ll bas=229,pri=37,pw[N],ha[N];
ll Ha(int l,int r){return (ha[r]-ha[l-1]*pw[r-l+1]%H+H)%H;}
int main()
{
	cin>>n>>(ch+1);pw[0]=1;f[n/2+1]=-1;
	for(int i=1;i<=n;i++)pw[i]=pw[i-1]*bas%H,ha[i]=(ha[i-1]*bas+ch[i]-'a'+pri)%H;
	for(int i=n/2;i>0;i--)
	{
		f[i]=f[i+1]+2;
		while(f[i]>0&&(i+f[i]-1>=n-i+1||Ha(i,i+f[i]-1)!=Ha(n-i-f[i]+2,n-i+1)))f[i]-=2;
	}
	for(int i=1;i<=(n+1)/2;i++)cout<<f[i]<<" ";
}