#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=3e6+5,M=N*4+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int n,m,k;char s[N],c[N];
namespace PAM{
	struct PAM{int link,len,son[29];}f[N];
	int Ct=1,LA;
	int getfa(int x,int id){while(x^1&&c[id-f[x].len-1]^c[id]) x=f[x].link;return x;}
	void BD(){
		f[0].link=1;f[1].len=-1;
		for(int i=1;i<=m;i++){
			int p=getfa(LA,i);
			if(!f[p].son[c[i]]){
				f[++Ct].len=f[p].len+2;f[Ct].link=f[getfa(f[p].link,i)].son[c[i]];f[p].son[c[i]]=Ct;
			}
			LA=f[p].son[c[i]];
		}
		ll ans=Ct-3;//cerr<<ans<<'\n';
		for(int i=2;i<=Ct;i++)if(f[f[i].link].len*2>=f[i].len){
			int x=f[i].len-f[f[i].link].len;
			// cerr<<x<<' '<<f[i].len<<'\n';
			if(f[i].len%x==0) ans+=(f[i].len/x-1)*2;
		}
		printf("%lld\n",ans);
	}
}
void Solve(){
	int i,j;scanf("%d",&n);
	for(i=1;i<=n;i++){
		scanf("%s",s+1);k=strlen(s+1);
		for(j=1;j<=k;j++) c[++m]=s[j]-'a'+1;
		c[++m]=27;c[++m]=28;
	}
	PAM::BD();
}
int main(){
	int t;
	// scanf("%d",&t);
	t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}