#include<cstdio>

#include<string.h>

#include<cstring>

#include<string>

using namespace std;

const int MAXN = 1e4 + ;

const int N = ;

const int maxn = 1e4 + ;

const int ALP = ;

struct PAM {

    int next[maxn][ALP];

    int fail[maxn];

    int cnt[maxn];

    int num[maxn];

    int len[maxn];

    int s[maxn];

    int last, n, p;

    int newnode(int l) {

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

            next[p][i] = ;

        cnt[p] = num[p] = ;

        len[p] = l;

        return p++;

    }

    void init() {

        p = ;

        newnode();

        newnode(-);

        last = ;

        n = ;

        s[n] = -;

        fail[] = ;

    }

    int get_fail(int x) {

        while (s[n - len[x] - ] != s[n]) x = fail[x];

        return x;

    }

    void add(int c) {

        c = c - 'a';

        s[++n] = c;

        int cur = get_fail(last);

        if (!next[cur][c]) {

            int now = newnode(len[cur] + );

            fail[now] = next[get_fail(fail[cur])][c];

            next[cur][c] = now;

            num[now] = num[fail[now]] + ;

        }

        last = next[cur][c];

        cnt[last]++;

    }

    void count() {

        for (int i = p - ; i >= ; i--)

            cnt[fail[i]] += cnt[i];

    }

}tree;

char s[MAXN];

string snew;

int q, ans[MAXN];

int main() {

    scanf("%d", &q);

    scanf("%s", s);

    for (int i = ; i < q; i++) {

        if (s[i] == '-') snew.pop_back();

        else snew.push_back(s[i]);

        tree.init();

        for (int j = ; j < snew.size(); j++) {

            tree.add(snew[j]);

        }

        tree.count();

        for (int j = ; j < tree.p; j++) {

            ans[i] += tree.cnt[j];

        }

    }

    for (int i = ; i < q; i++) {

        printf("%d ", ans[i]);

    }

    return ;

}