#include<bits/stdc++.h>
using namespace std ; 
#define maxn 2000009
#define ll long long 
#define pb push_back 
#define fi first 
#define se second 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1 
#define TIME ( 1.0*clock() / CLOCKS_PER_SEC )
const int mod = 1e9+7 ;
const int INF = 1e9 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } 

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a >= mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ;
}

mt19937 rng (time(0)) ; 

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

int ch [maxn][27] ; 
int fail [maxn] , len [maxn] ; 
char c [maxn] ; 
int cn = 1 ; 
int main () 
{
	ios_base::sync_with_stdio(0); 
	cin.tie(0);cout.tie(0); 
//	rf () ;
	fail [0] = 1 , fail [1] = 0 , len [0] = 0 , len [1] = -1 ; 
	int test ; cin >> test ; 
	while ( test -- ) 
	{
		cin >> c + 1 ; 
		int L = strlen (c+1) ; 
		int p = 1 ; 
		for ( int i = 1 ; i <= L ; i ++ ) 
		{
			while ( c [i] != c [i-1-len[p]]) p = fail [p] ; 
			int x = c [i] - 97 ; 
			if ( !ch[p][x] ) 
			{
				int q = ++ cn ; len [q] = len [p] + 2 ; 
				int t = fail [p] ; 
				while ( c [i] != c [i-1-len[t]]) t = fail [t] ; 
				fail [q] = ch [t][x] , ch [p][x] = q ; 
			}
			p = ch [p][x] ; 
		}
	}
	ll res = 0 ; 
	for ( int i = 2 ; i <= cn ; i ++ ) 
	{
		int x = len [i] - len [fail[i]] ; 
		if ( len [i] % x ) res ++ ; 
		else res += (len[i]/x) * 2 - 1 ; 
	}
	
	cout << res ; 
}