#include<bits/stdc++.h> using namespace std; #define int long long #define pii pair<int,int> #define fr first #define sc second #define mk make_pair #define pb push_back #define inx(u) int I=h[(u)],v=edge[I].v;I;I=edge[I].nx,v=edge[I].v int read(){int x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();return x*f;} const int MAXN=100010,N=10010,base=131,Mod1=1011451423,Mod=1e9+7; struct Edge{int v,nx;}edge[MAXN<<1];int h[MAXN],CNT;void add_side(int u,int v){edge[++CNT]={v,h[u]};h[u]=CNT;edge[++CNT]={u,h[v]};h[v]=CNT;} void add(int &x,int y){x+=y;if(x>=Mod)x-=Mod;} int n,m,ans,rans,d[MAXN],as[MAXN]; char c[MAXN]; map<int,int>mp; void slv(){ n=read(); scanf("%s",c+1); for(int i=1;i<=n;i++){ int hs=0; for(int j=i;j>=1;j--){ hs=(hs*base+c[j])%Mod1; add(ans,mp[hs]),mp[hs]++; } as[i]=(as[i-1]+ans)%Mod; printf("%lld\n",as[i]); } } signed main(){ // freopen("string.in","r",stdin);freopen("string.out","w",stdout); slv(); return 0; }