#include <bits/stdc++.h>
// #include <bits/extc++.h>
 
using namespace std;
// using namespace __gnu_pbds;
 
#ifdef LOCAL
void dbg() { cerr << '\n'; }
template<class T, class ...U> void dbg(T a, U ...b) { cerr << a << ' ', dbg(b...); }
template<class T> void org(T l, T r) { while (l != r) cerr << *l++ << ' '; cerr << '\n'; }
#define debug(args...) (dbg("(" + string(#args) + ") = (", args, ")"))
#define orange(args...) (cerr << "[" + string(#args) + ") = ", org(args))
#else
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define debug(...) ((void)0)
#define orange(...) ((void)0)
#endif
template<class T> bool chmin(T &a, T b) { return b < a and (a = b, true); }
template<class T> bool chmax(T &a, T b) { return b > a and (a = b, true); }
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define ff first
#define ss second
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<double, double> pdd;
 
// template<class T> using BST = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

constexpr int INF = 1<<30;
constexpr long long mod = 998244353;

struct PAM {
	struct Node {
		int fail, len;
		array<int, 26> ch;
		Node(int len) : fail(0), len(len), ch{} {};
	};
	vector<Node> G;
	int odd, even, lst;
	int new_node(int len) {
		G.emplace_back(len);
		return G.size() - 1;
	}
	PAM() : odd(new_node(-1)), even(new_node(0)) {
		lst = G[even].fail = odd;
	}
	string S;
	int up(int p) {
		while (rbegin(S)[G[p].len + 1] != S.back())
			p = G[p].fail;
		return p;
	}
	void add(char c) {
		S += c;	
		lst = up(lst);
		if (!G[lst].ch[c - 'a']) G[lst].ch[c - 'a'] = new_node(G[lst].len + 2);
		int p = G[lst].ch[c - 'a'];
		G[p].fail = (lst == odd ? even : G[up(G[lst].fail)].ch[c - 'a']);
		lst = p;
	}
	void build(string s) {
		lst = odd;
		for (char c : s) add(c);
		S.clear();
	}
	long long cal() {
		long long ans = 0;
		for (int i = G.size() - 1; i > 1; i--) {
			int len = G[i].len;
			int d = len - G[G[i].fail].len;
			if (len % d) ans++;
			else ans += (len / d) * 2 - 1;
		}
		return ans;
	}
};

void solve() {
	int n;
	cin >> n;

	PAM pam;
	for (int i = 0; i < n; i++) {
		string s;
		cin >> s;
		pam.build(s);
	}

	cout << pam.cal() << '\n';
}

signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int T = 1;
	// cin >> T;
	while (T--) solve();
	return 0;
}

/*

3
abaaa
abbbba
bbbaba

*/