import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto N = RD;
	auto S = new string[](N);
	foreach (i; 0..N)
	{
		S[i] = RD!string;
	}
	S.sort!"a.length < b.length"();

	struct Node
	{
		Node* par;
		Node*[] chi;
		int c;
		int cnt;

		this(Node* _par, int _c)
		{
			par = _par;
			c = _c;
		}

		Node* search(int d)
		{
			foreach (e; chi)
			{
				if ((*e).c == d)
					return e;
			}
			return null;
		}

		int[] getCnt()
		{
			auto res = new int[](26);
			foreach (e; chi)
			{
				res[(*e).c] = (*e).cnt;
			}
			return res;
		}

		Node* addChild(int d)
		{
			auto child = new Node(&this, d);
			chi ~= child;
			return child;
		}
	}

	Node* root = new Node(null, -1);
	
	long ans;
	foreach (i; 0..N)
	{
		auto SS = S[i];
		auto cnt = new int[][](SS.length+1, 26);
		foreach (j; 0..SS.length)
		{
			cnt[j+1] = cnt[j].dup;
			cnt[j+1][SS[j]-'a'] = 1;
		}

		Node* node = root;
		foreach_reverse (j; 0..SS.length)
		{
			auto cnt2 = (*node).getCnt();
			debug writeln(cnt2);
			foreach (k, e; cnt2)
			{
				ans += cnt[j+1][k] * e;
			}

			auto c = SS[j]-'a';
			auto r = (*node).search(c);
			if (r == null)
			{
				node = (*node).addChild(c);
			}
			else
			{
				node = r;
			}
			debug writeln("j:", j, " ", SS[j], " ans:", ans);
		}
		(*node).cnt += 1;
		debug writeln("i:", i, " ", SS, " ans:", ans);
	}

	writeln(ans);
	stdout.flush;
	debug readln;
}