#include<bits/stdc++.h>
using namespace std;
char C[2000100];
int n,te[2001000];
const int mod=1e9+7,W=131;
int hs[2001000],Wo[2001000];
int has(int l,int r){return ((hs[r]-1ll*hs[l-1]*Wo[r-l+1]%mod)+mod)%mod;}
int lc(int x,int y){
	if(x>y)swap(x,y);
	int l=1,r=te[n]-y+1,lc=0;
	while(l<=r){
		int mi=(l+r)>>1;
		if(has(x,x+mi-1)==has(y,y+mi-1))lc=mi,l=mi+1;
		else r=mi-1;
	}
	return lc;
}
int lcp(int l1,int r1,int l2,int r2){
	int p1=r1-l1+1,p2=r2-l2+1;
	if(p1>p2)swap(l1,l2),swap(r1,r2),swap(p1,p2);
	int e=lc(l1,l2);
	if(e<p1)return e;
	if(p1<p2){
		e=lc(l2,l2+p1);
		if(e<p2-p1)return e+p1;
	}
	e=lc(l2+p2-p1,l1);
	if(e<p1)return p2+e;
	return p1+p2;
}
int sgn(int l1,int r1,int l2,int r2){
	int le=lcp(l1,r1,l2,r2),p1=r1-l1+1,p2=r2-l2+1;
	if(le==p1+p2)return 0;
	le++; 
	return (C[(le<=p1)?(l1+le-1):(l2+(le-p1)-1)]<C[(le<=p2)?(l2+le-1):(l1+(le-p2)-1)])?-1:1;
}
#define ll long long
struct qq{int l,r,z;}a[2000100];
int b[2000100],L[2000100],R[2001000],sta[2000100],top;
map<int,int>lt;
int main(){
	scanf("%d",&n);
	ll sum=0;
	for(int i=1;i<=n;i++){
		scanf("%s",C+1+te[i-1]);
		te[i]=strlen(C+1+te[i-1]);te[i]+=te[i-1];
        a[i]=(qq){te[i-1]+1,te[i],i};
	}
	Wo[0]=1;
	for(int i=1;i<=te[n];i++)hs[i]=(1ll*hs[i-1]*W%mod+(int)C[i])%mod,
	Wo[i]=1ll*W*Wo[i-1]%mod;
	sort(a+1,a+n+1,[&](qq x,qq y){return sgn(x.l,x.r,y.l,y.r)==-1;});
    int M=1e9;
	for(int i=1;i<n;i++){
        if(sgn(a[i].l,a[i].r,a[i+1].l,a[i+1].r)==0)b[i]=M++;
        else b[i]=lcp(a[i].l,a[i].r,a[i+1].l,a[i+1].r);
	}
    n--;
    for(int i=1;i<=n;i++){
        while(top&&b[sta[top]]>=b[i])top--;
        L[i]=sta[top],sta[++top]=i;
    }
    top=0,sta[0]=n+1;
    for(int i=n;i;i--){
        while(top&&b[sta[top]]>=b[i])top--;
        R[i]=sta[top],sta[++top]=i;
    }
    long long ans=0;
    for(int i=1;i<=n;i++){
        int z=lt[b[i]];lt[b[i]]=i;if(!z)continue;
        if(R[z]<i)continue;
        ans+=1ll*(i-z)*(z-L[z])*(R[i]-i);
    }
    printf("%lld",ans);
	return 0;
}