#include<bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// macros
#define int long long 
#define ll long long 
#define ld long double
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define sz(x) ((int)((x).size()))

template <typename A, typename B>
string to_string(pair<A, B> p);
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char& s) {
  return to_string(string(1, s));
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "1" : "0");
}
 
string to_string(vector<bool> v) {
	bool first = true;
	string res = "{";
	for (int i = 0; i < static_cast<int>(v.size()); i++) {
		if (!first) {
			res += ", ";
		}
		first = false;
		res += to_string(v[i]);
	}
	res += "}";
	return res;
}
 
template <size_t N>
string to_string(bitset<N> v) {
	string res = "";
	for (size_t i = 0; i < N; i++) {
		res += static_cast<char>('0' + v[i]);
	}
	return res;
}
 
template <typename A>
string to_string(A v) {
	bool first = true;
	string res = "{";
	for (const auto &x : v) {
		if (!first) {
			res += ", ";
		}
		first = false;
		res += to_string(x);
	}
	res += "}";
	return res;
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
	return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
	return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
    return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
 
void debug_out() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
 
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

template <typename T1, typename T2>
inline auto mini(T1 a, T2 b) { return (a < b ? a : b); }
template<typename T, typename... Args>
inline auto mini(T a, Args... args) { return mini(a, mini(args...)); }
template <typename T1, typename T2>
inline auto maxi(T1 a, T2 b) { return (a > b ? a : b); }
template<typename T, typename... Args>
inline auto maxi(T a, Args... args) { return maxi(a, maxi(args...)); }
template<typename T>
T gcd(T a, T b) { if(a==0 or b==0) return a+b; return gcd(b, a%b) ; }
template<typename T>
T lcm(T a, T b) { if(a==0 or b==0) return 0; return a/gcd(a, b)*b; }

// random number generator
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); // use mt19937_64 for 64 bit

// constants
const long double eps = LDBL_EPSILON;
const int inf = 1e15;
const int modn = 1e9+7;
const int maxn = 2e5+3;

struct TRIE {
	static const int Alpha = 26;
	struct node {
		char ch;
		int cntend;
		int par;
		int child[Alpha];

		node() {
			ch = '#', cntend = 0, par = -1;
			memset(child, -1, sizeof(child));
		}
		node(char _ch) {
			ch = _ch, cntend = 0, par = -1;
			memset(child, -1, sizeof(child));
		}
	};

	vector<node> tree;

	TRIE() {
		tree.push_back(node());
	}

	void insert(string s) {
		int cur = 0;
		for(char ch : s) {
			assert(cur < sz(tree));
			if(tree[cur].child[ch - 'a'] == -1) {
				tree[cur].child[ch - 'a'] = sz(tree);
				tree.push_back(*(new node(ch)));
			}
			int to = tree[cur].child[ch - 'a'];
			tree[to].par = cur;
			cur = to;
		}
		assert(cur < sz(tree));
		tree[cur].cntend++;
	}

	bool check(string s) {
		int cur = 0;
		for(char ch : s) {
			if(tree[cur].child[ch - 'a'] == -1) return false;
			cur = tree[cur].child[ch - 'a'];
		}
		return tree[cur].cntend > 0;
	}

	int count() {
		int ans = 0;
		for(int i = 1; i < sz(tree); i++) {
			if(tree[i].cntend == 0) continue;
			int res = 0;
			set<char> st{tree[i].ch};
			int cur = tree[i].par;
			while(cur != -1) {
				for(char ch : st) {
					int to = tree[cur].child[ch - 'a'];
					if(to != -1 and to != i and tree[to].cntend > 0) {
						res += tree[i].cntend * tree[to].cntend;
					}
				}
				st.insert(tree[cur].ch);
				cur = tree[cur].par;
			}
			ans += res;
		}
		return ans;
	}

};

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    // Your code here
	int n;
	cin >> n;
	vector<string> a(n);
	TRIE t1;
	for(int i = 0; i < n; i++) {
		cin >> a[i];
		reverse(a[i].begin(), a[i].end());
		t1.insert(a[i]);
	}	
	int ans = t1.count();
	cout << ans << "\n";
    return 0;
}


Measured memory_bytes: 464544