#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 2e5 + ;

int n;

ll ans;

namespace SAM

{

    int root, sz, last;

    struct node {

        int par, val;

        map<int, int> ch;

    } t[N];

    int nw(int x) { t[++sz].val = x; return sz; }

    void iniSAM() { sz = ; root = last = nw(); }

    void extend(int c)

    {

        int p = last, np = nw(t[p].val + );

        while(p && !t[p].ch[c]) t[p].ch[c] = np, p = t[p].par;

        if(!p) t[np].par = root;

        else

        {

            int q = t[p].ch[c];

            if(t[q].val == t[p].val + ) t[np].par = q;

            else

            {

                int nq = nw(t[p].val + );

                t[nq].ch = t[q].ch;

                t[nq].par = t[q].par;

                t[q].par = t[np].par = nq;

                while(p && t[p].ch[c] == q) t[p].ch[c] = nq, p = t[p].par;

            }

        }

        ans += t[np].val - t[t[np].par].val;

        last = np;

    }

} using namespace SAM;

int main()

{

    scanf("%d", &n);

    iniSAM();

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

    {

        int x;

        scanf("%d", &x);

        extend(x);

        printf("%lld\n", ans);

    }

    return ;

}