#include<iostream>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<queue>
#include<set> 
#include<stack>
#include<bitset>
#include<unordered_map>
#include<iomanip>
#include<cassert>
#include<array>
#define fi first
#define se second
#define endl '\n'
#define pb push_back
#define ep emplace_back 
#define debug(x) cout<<x<<'\n'
#define RES cout<<res<<'\n'
#define ANS cout<<ans<<'\n'
#define YES	cout<<"YES"<<'\n'
#define NO cout<<"NO"<<'\n'
#define Yes	cout<<"Yes"<<'\n'
#define No cout<<"No"<<'\n'
#define me(a,x) memset(a,x,sizeof(a))
#define L(i,j,k) for(int i=(j);i<=(k);++i)
#define R(i,j,k) for(int i=(j);i>=(k);--i)
#define r23 cout<<233<<endl;return;
#define int long long 
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<PII,int> PIII;
typedef unsigned long long ull;
const int N=1e6+5,P=131,mod=998244353;
int res;
struct node{
	char s[N];
	int n,la;
	int tr[N][28],fail[N],len[N],cnt[N],dep[N];
	int root[N];
	int r0,r1,tot,pos,last;
	void init(){
		r0=0,r1=1,la=0;
		last=0,pos=0,tot=1;
		len[r0]=0,len[r1]=-1;
		fail[r0]=fail[r1]=r1;
	}
	int get_fail(int p){
		while(s[pos-len[p]-1]!=s[pos]){
			p=fail[p];
		}
		return p;
	}
	void insert(char c){
		s[++pos]=c;
		if(c>'z')last=0;
		int x=c-'a',p=get_fail(last);
		if(!tr[p][x]){
			len[++tot]=len[p]+2;
			fail[tot]=tr[get_fail(fail[p])][x];
			if(len[tot]-len[fail[tot]]==len[root[fail[tot]]]){
				root[tot]=root[fail[tot]];
				dep[tot]=dep[fail[tot]]+1;
			}else{
				root[tot]=tot;
				dep[tot]=1;
			}
			if(s[pos]<='z')res+=2*dep[tot]-1;
			tr[p][x]=tot;
		}
		last=tr[p][x];
	}
	void build(string s){
		for(char c:s)insert(c);
	}
}PAM;
void solve(){
	PAM.init();
	int t;cin>>t;
	while(t--){
		string s;cin>>s;
		char c1='z'+1,c2='z'+2;
		s=c1+s,s=c2+s;
		PAM.build(s);
	}
	RES;
}
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}