#2033. 「SDOI2016」生成魔咒

#include<iostream>
#include<cstdio>
#include<string>
#include<ctime>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<stack>
#include<climits>
#include<queue>
#include<map>
#include<set>
#include<sstream>
#include<cassert>
using namespace std;
typedef long long ll;
const int N=2000010;
int tot=1, last=1;
struct Node{
    int len, fa;
    map<int,int> ch;
}node[N];
char str[N];
ll f[N], ans;
void extend(int c){
    int p=last, np=last=++tot;
    f[tot]=1;
    node[np].len=node[p].len+1;
    for(; p && !node[p].ch[c]; p=node[p].fa)
        node[p].ch[c]=np;
    if(!p) node[np].fa=1;
    else {
        int q=node[p].ch[c];
        if(node[q].len==node[p].len+1)
            node[np].fa=q;
        else {
            int nq=++tot;
            node[nq]=node[q];node[nq].len=node[p].len+1;
            node[q].fa=node[np].fa=nq;
            for( ; p && node[p].ch[c]==q; p=node[p].fa)
                node[p].ch[c]=nq;
        }
    }
    ans+=(long long )node[np].len-node[node[np].fa].len;
}
int n,x;
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&x);
        extend(x);
        cout<<ans<<endl;
    }
}