int  Manacher(string s)

 {

     string t = "$#";

     for (int i = ; i < s.size(); ++i)

     {

         t += s[i];

         t += "#";

     }

     vector<int> p(t.size(), );

     int maxx=;

     int mx = , id = , resLen = , resCenter = ;

     for (int i = ; i < t.size(); ++i)

     {

       //  maxx=max(maxx,p[i]);

         p[i] = mx > i ? min(p[ * id - i], mx - i) : ;

         while (t[i + p[i]] == t[i - p[i]])

             ++p[i];

         if (mx < i + p[i])

         {

             mx = i + p[i];

             id = i;

         }

         if (resLen < p[i])

         {

             resLen = p[i];

             resCenter = i;

         }

             maxx=max(maxx,p[i]);

     }

     return maxx-;

 }

 #include<bits/stdc++.h>

 using namespace std;

 # define maxn +

 char str1[maxn];

 char str2[maxn*];

 int p[maxn*];

 int l=;

 int ma()

 {

     int id=,mx=;

     int ans=;

     str2[l]='\0';

     for(int i=; i<l+; i++)p[i]=;

     for(int i=; i<l; i++)

     {

         if(i<mx)p[i]=min(p[*id-i],mx-i);

         else p[i]=;

         while(str2[i-p[i]]==str2[i+p[i]])

             p[i]++;

         if(mx<i+p[i])

         {

             id=i;

             mx=i+p[i];

         }

         ans+=p[i]/;

     }

     return ans;

 }

 int main()

 {

     int n;

     scanf("%d",&n);

     scanf("%s",str1);

     str2[l++]='$';

     str2[l++]='#';

     for(int i=; i<n; i++)

     {

         if(str1[i]=='-')

         {

             if(l-!=)l-=;

         }

         else

         {

             str2[l++]=str1[i];

             str2[l++]='#';

         }

         printf("%d",ma());

         if(i!=n-)printf(" ");

     }

     printf("\n");

     return ;

 }

 void Manacher(int n)

 {

     int i, id=, len=;

     Estr[] = '$';

     for(i=start[n]; i<start[n+]; i++)

     {

         Estr[len++] = '#';

         Estr[len++] = MumStr[i];

         suffix[i] = false;

         prefix[i] = false;

     }

     Estr[len] = '#';

     Estr[len+] = ;

     for(i=; i<len; i++)

     {

         p[i] = ;

         if(p[id]+id > i)

             p[i] = min(p[id*-i], p[id]+id-i);

         while(Estr[ i+p[i] ] == Estr[ i-p[i] ])

             p[i]++;

         if(p[id]+id < p[i]+i)

             id = i;

   }

 }